Relationships between Nondeterministic and Deterministic Tape Complexities

Journal of Symbolic Logic 39 (2):346-347 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272688

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,592

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Relating word and tree automata.Orna Kupferman, Shmuel Safra & Moshe Y. Vardi - 2006 - Annals of Pure and Applied Logic 138 (1):126-146.
Deterministic and Nondeterministic Strategies for Hintikka games in First-order and Branching-quantifier logic.Thomas Forster - 2006 - Logique Et Analyse 195:265--9.
Relations between Time and Tape Complexities.John E. Hopcroft & Jeffrey D. Ullman - 1973 - Journal of Symbolic Logic 38 (2):343-343.
Tailoring recursion for complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
5-valued Non-deterministic Semantics for The Basic Paraconsistent Logic mCi.Arnon Avron - 2008 - Studies in Logic, Grammar and Rhetoric 14 (27).
Review: John E. Hopcroft, Jeffrey D. Ullman, Relations between Time and Tape Complexities. [REVIEW]Jiri Becvar - 1973 - Journal of Symbolic Logic 38 (2):343-343.
Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity.Daniele Mundici - 1984 - Annals of Pure and Applied Logic 27 (3):265-273.
Tense logic for nondeterministic time.Ewa Orlowska - 1982 - Bulletin of the Section of Logic 11 (3-4):127-131.
Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics.Ofer Arieli, Arnon Avron & Anna Zamansky - 2011 - Studia Logica 97 (1):31 - 60.
Nondeterministic three-valued logic: Isotonic and guarded truth-functions.Peter Päppinghaus & Martin Wirsing - 1983 - Studia Logica 42 (1):1 - 22.
Algorithmic Information Theory: The Basics.Adam Elga - unknown
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
Super Turing-machines.Jack Copeland - 1998 - Complexity 4 (1):30-32.
'Tape' plays Teletribunals.Lynn Turner - unknown
Is our Universe Deterministic? Some Philosophical and Theological Reflections on an Elusive Topic.Taede A. Smedes - 2003 - Zygon 38 (4):955-979.

Analytics

Added to PP
2015-02-05

Downloads
10 (#1,186,283)

6 months
2 (#1,192,610)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
The complexity of temporal logic over the reals.Mark Reynolds - 2010 - Annals of Pure and Applied Logic 161 (8):1063-1096.

View all 14 citations / Add more citations

References found in this work

No references found.

Add more references