Acceptable notation
From MaRDI portal
Publication:1148675
DOI10.1305/ndjfl/1093883561zbMath0452.68055OpenAlexW4246976488MaRDI QIDQ1148675
Publication date: 1982
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1093883561
Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
What is the Church-Turing Thesis? ⋮ On efficiency of notations for natural numbers ⋮ Honest universality ⋮ SELF-REFERENCE UPFRONT: A STUDY OF SELF-REFERENTIAL GÖDEL NUMBERINGS ⋮ The dependence of computability on numerical notations ⋮ Can Church's thesis be viewed as a Carnapian explication? ⋮ Generalization of Shapiro's theorem to higher arities and noninjective notations ⋮ Honest Computability and Complexity ⋮ Three Paths to Effectiveness ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ The influence of domain interpretations on computational models ⋮ ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
