Logic and Computational Complexity
Volume 960 of the series Lecture Notes in Computer Science pp 447462
A constantspace sequential model of computation for firstorder logic
 Steven LindellAffiliated withDepartment of Computer Science, Haverford College
Abstract
We define and justify a natural sequential model of computation with a constant amount of read/write work space, despite unlimited (polynomial) access to readonly input and writeonly 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 firstorder logic, giving a duality between (readonce) constantspace serial algorithms and constanttime parallel algorithms.
 Title
 A constantspace sequential model of computation for firstorder logic
 Book Title
 Logic and Computational Complexity
 Book Subtitle
 International Workshop LCC'94 Indianapolis, IN, USA, October 13–16, 1994 Selected Papers
 Pages
 pp 447462
 Copyright
 1995
 DOI
 10.1007/3540601783_97
 Print ISBN
 9783540601784
 Online ISBN
 9783540447207
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 960
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Steven Lindell ^{(1)}
 Author Affiliations

 1. Department of Computer Science, Haverford College, 190411392, Haverford, PA
Continue reading...
To view the rest of this content please follow the download PDF link above.