Real functions and numbers defined by Turing machines
From MaRDI portal
Publication:1050122
DOI10.1016/0304-3975(83)90035-XzbMath0512.68064MaRDI QIDQ1050122
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
03D10: Turing machines and related notions
03F99: Proof theory and constructive mathematics
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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