Real functions and numbers defined by Turing machines

DOI10.1016/0304-3975(83)90035-XzbMath0512.68064OpenAlexW2055501139MaRDI QIDQ1050122

Rudolf Freund

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90035-x

zbMATH Keywords

omega languagesinfinite strings of digits as real numbersTuring functionsTuring numbers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10) Proof theory and constructive mathematics (03F99)

Related Items

Unnamed Item, \(\delta\)-uniform BSS machines, Recursively Generated Evolutionary Turing Machines and Evolutionary Automata

Cites Work

• On the complexity of \(\omega\)-type Turing acceptors
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
• \(\omega\)-computations on Turing machines
• \(\omega\)-computations on deterministic pushdown machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item