New Computational Paradigms

DOI10.1007/b136981zbMath1115.03031OpenAlexW2278484831MaRDI QIDQ5717043

Peter Koepke

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136981

zbMATH Keywords

ordinal computability

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Computable structure theory, computable model theory (03C57) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Recognizable sets and Woodin cardinals: computation beyond the constructible universe

This page was built for publication: New Computational Paradigms