Godel Numberings Versus Friedberg Numberings
From MaRDI portal
Publication:5554965
DOI10.2307/2034045zbMath0168.25404OpenAlexW4237892602MaRDI QIDQ5554965
Publication date: 1964
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2034045
Related Items
Semi-effective numberings and definitions of the computable numbers ⋮ Learning-theoretic perspectives of acceptable numberings ⋮ How much partiality is needed for a theory of computability? ⋮ The independence of control structures in abstract programming systems ⋮ Some effectively infinite classes of enumerations ⋮ On computable enumerations. I ⋮ Über die Reduzierbarkeit berechenbarer Numerierungen ⋮ Computable one-to-one enumerations of effective domains ⋮ Some applications of computable one-one numberings ⋮ Computable single-valued numerations