The Computational Power of Turing's Non-Terminating Circular a-Machines
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F13%3A00384527" target="_blank" >RIV/67985807:_____/13:00384527 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The Computational Power of Turing's Non-Terminating Circular a-Machines
Original language description
A variant of Turing's original a-machines --- the so-called non-terminating circular a-machine --- is shown to be computationally equivalent to a model of unbounded computational processes whose computational power reaches up to higher levels of the arithmetical hierarchy.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP202%2F10%2F1333" target="_blank" >GAP202/10/1333: NoSCoM: Non-Standard Computational Models and Their Applications in Complexity, Linguistics, and Learning</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Book/collection name
Alan Turing - His Work and Impact
ISBN
978-0-12-386980-7
Number of pages of the result
6
Pages from-to
80-85
Number of pages of the book
910
Publisher name
Elsevier
Place of publication
Amsterdam
UT code for WoS chapter
—