Turing machines and the spectra of first-order formulas with equality

Authors:
Neil D. Jones;Alan L. Selman
Affiliations:
-;-
Venue:
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Year:
1972

Citing 2
Cited 2

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Comparing complexity classes

Journal of Computer and System Sciences
Periodicity in tilings

DLT'10 Proceedings of the 14th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show that these similarities are not accidental - that spectra and context sensitive languages are closely related, and that their open questions are merely special cases of a family of open questions which relate to the difference (if any) between deterministic and non-deterministic time-or space-bounded Turing machines.