Effectivity and reducibility with ordinal Turing machines

DOI10.3233/COM-210307zbMath1500.03015arXiv1811.11630MaRDI QIDQ5037207

Merlin Carl

Publication date: 28 February 2022

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.11630

zbMATH Keywords

effective reducibility; ordinal computability

Mathematics Subject Classification ID

03E35: Consistency and independence results

03D30: Other degrees and reducibilities in computability and recursion theory

03D10: Turing machines and related notions

03E25: Axiom of choice and related propositions