Ordinal Computability
From MaRDI portal
Publication:3576060
DOI10.1007/978-3-642-03073-4_29zbMath1268.03060MaRDI QIDQ3576060
Publication date: 28 July 2010
Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_29
03D10: Turing machines and related notions
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
Finding bases of uncountable free abelian groups is usually difficult, Unnamed Item, 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09, Koepke machines and satisfiability for infinitary propositional languages, The distribution of ITRM-recognizable reals, The computational strengths of \(\alpha\)-tape infinite time Turing machines, OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES, A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0, $$ITRM$$-Recognizability from Random Oracles
Cites Work
