Logic and Computational Complexity pp 447-462
A constant-space sequential model of computation for first-order logic
- First Online:
- Cite this paper as:
- Lindell S. (1995) A constant-space sequential model of computation for first-order logic. In: Leivant D. (eds) Logic and Computational Complexity. Lecture Notes in Computer Science, vol 960. Springer, Berlin, Heidelberg
We define and justify a natural sequential model of computation with a constant amount of read/write work space, despite unlimited (polynomial) access to read-only input and write-only output. The model is both deterministic, uniform, and sequential. The constant work space is modeled by a finite number of destructive read boolean variables, assignable by formulas over the canonical boolean operations. We then show that computation on this model is equivalent to expressibility in first-order logic, giving a duality between (read-once) constant-space serial algorithms and constant-time parallel algorithms.
Unable to display preview. Download preview PDF.