Minimality considerations for ordinal computers modeling constructibility
From MaRDI portal
Publication:2482462
DOI10.1016/j.tcs.2007.12.012zbMath1136.03026MaRDI QIDQ2482462
Publication date: 16 April 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.12.012
ordinal arithmetic; set theory; constructibility; hypercomputation; abstract computability; well-structured programming
03E45: Inner models, including constructibility, ordinal definability, and core models
03D10: Turing machines and related notions
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
Cites Work