SU\G(𝔸)/K·U

ω-Computations on Turing machines

Rina Cohen, Arie Y. Gold

Type: Article

Publication Date: 1978-01-01

Citations: 68

DOI: https://doi.org/10.1016/0304-3975(78)90002-6

Locations

  • Theoretical Computer Science - View

Similar Works

Action Title Year Authors
+ Acceptance of ω-Languages by Communicating Deterministic Turing Machines 2001 Rudolf Freund
Ludwig Staiger
+ A note on the Turing machine theory of computation 2011 Stephen Boyce
+ Turing degrees of hypersimple relations on computable structures 2003 Valentina Harizanov
+ Computations of (α, k)-machines 1981 Janusz Stokłosa
W. Żakowski
+ Space Complexity in Infinite Time Turing Machines 2007 Joost de Winter
+ On the strongly bounded turing degrees of simple sets 2014 Klaus Ambos–Spies
+ Turing machine algorithms and studies in quasi-randomness 2011 Subrahmanyam Kalyanasundaram
+ PDF Chat Cardinal-Recognizing Infinite Time Turing Machines 2013 Miha E. Habič
+ Real functions and numbers defined by Turing machines 1983 Rudolf Freund
+ A Computable Structure with Nonstandard Computability 2017 R. R. Avdeev
V. G. Puzarenko
+ On the strongly bounded turing degrees of simple sets. 2014 Klaus Ambos–Spies
+ A Computable Structure with Non-Standard Computability 2019 R. R. Avdeev
V. G. Puzarenko
+ On computably enumerable structures 2014 Bakh Khoussainov
+ Zigzags in Turing machines 2010 Anahí Gajardo
P. Guillon
+ Three books on computability, with a special focus on Turing's legacy 2018 Christopher P. Porter
+ PDF Chat The Complexity of Small Universal Turing Machines: A Survey 2012 Turlough Neary
Damien Woods
+ The complexity of small universal Turing machines: A survey 2008 Damien Woods
Turlough Neary
+ On computable enumerations 1968 Yu. L. Ershov
+ Deviant encodings and Turing’s analysis of computability 2010 B. Jack Copeland
Diane Proudfoot
+ PDF Chat On Models of a Nondeterministic Computation 2009 M. Vyalyi

Works That Cite This (28)

Action Title Year Authors
+ PDF Chat On the High Complexity of Petri Nets $$\omega $$-Languages 2020 Olivier Finkel
+ PDF Chat The Complexity of Infinite Computations In Models of Set Theory 2009 Olivier Finkel
+ PDF Chat Decision Problems For Turing Machines 2009 Olivier Finkel
Dominique Lecomte
+ Polishness of some topologies related to word or tree automata 2017 Olivier Finkel
Olivier Carton
Dominique Lecomte
+ Decision problems for Turing machines 2009 Olivier Finkel
Dominique Lecomte
+ PDF Chat The exact complexity of the infinite Post Correspondence Problem 2015 Olivier Finkel
+ PDF Chat Logic, Computation, Hierarchies 2014 J Duparc
Olivier Finkel
Jean-Pierre Ressayre
+ PDF Chat Locally finite ω‐languages and effective analytic sets have the same topological complexity 2016 Olivier Finkel
+ Real functions and numbers defined by Turing machines 1983 Rudolf Freund
+ Effectively closed sets and graphs of computable real functions 2002 Douglas Cenzer
Jeffrey B. Remmel

Works Cited by This (0)

Action Title Year Authors