Acceptable notation

DOI10.1305/NDJFL/1093883561zbMATH Open0452.68055OpenAlexW4246976488MaRDI QIDQ1148675FDOQ1148675

Authors: Stewart Shapiro 

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

zbMATH Keywords

computabilitynumber-theoretic functionsstring-theoretic functions

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Algorithms in computer science (68W99)

Cited In (13)

• What is the Church-Turing Thesis?
• ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
• The dependence of computability on numerical notations
• SELF-REFERENCE UPFRONT: A STUDY OF SELF-REFERENTIAL GÖDEL NUMBERINGS
• Honest computability and complexity
• On efficiency of notations for natural numbers
• Honest universality
• Three paths to effectiveness
• The influence of domain interpretations on computational models
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• Can Church's thesis be viewed as a Carnapian explication?
• Generalization of Shapiro's theorem to higher arities and noninjective notations
• The Church-Turing Thesis over Arbitrary Domains

This page was built for publication: Acceptable notation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148675)