Time and Space Measures for a Complete Graph Computation Model
Programming Languages
2022-12-23 v1
Abstract
We present a computation model based on a subclass of GP 2 graph programs which can simulate any off-line Turing machine of space complexity O(s(n) log s(n)) in space O(s(n)). The simulation only requires a quadratic time overhead. Our model shares this property with Sch\"onhage's storage modification machines and Kolmogorov-Uspenskii machines. These machines use low-level pointer instructions whereas our GP 2-based model uses pattern-based transformation rules and high-level control constructs.
Keywords
Cite
@article{arxiv.2212.11637,
title = {Time and Space Measures for a Complete Graph Computation Model},
author = {Brian Courtehoute and Detlef Plump},
journal= {arXiv preprint arXiv:2212.11637},
year = {2022}
}
Comments
In Proceedings GCM 2022, arXiv:2212.10975