A PROOF OF THE EQUIVALENCE OF COMPUTABILITY TO RECURSIVENESS WITH NO ARITHMETIZATION
From MaRDI portal
Publication:5685064
DOI10.2206/KYUSHUMFS.24.100zbMath0267.02028OpenAlexW2151422596MaRDI QIDQ5685064
Publication date: 1970
Published in: Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2206/kyushumfs.24.100
Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory (03D99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
This page was built for publication: A PROOF OF THE EQUIVALENCE OF COMPUTABILITY TO RECURSIVENESS WITH NO ARITHMETIZATION
