The following pages link to Acceptable notation (Q1148675):
Displaying 13 items.
- The influence of domain interpretations on computational models (Q1036525) (← links)
- On efficiency of notations for natural numbers (Q2143116) (← links)
- Can Church's thesis be viewed as a Carnapian explication? (Q2695029) (← links)
- Generalization of Shapiro's theorem to higher arities and noninjective notations (Q2700823) (← links)
- Honest universality (Q2941591) (← links)
- Honest Computability and Complexity (Q3305319) (← links)
- Three Paths to Effectiveness (Q3586000) (← links)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
- ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS (Q5001552) (← links)
- What is the Church-Turing Thesis? (Q5055286) (← links)
- The Church-Turing Thesis over Arbitrary Domains (Q5452180) (← links)
- SELF-REFERENCE UPFRONT: A STUDY OF SELF-REFERENTIAL GÖDEL NUMBERINGS (Q6041342) (← links)
- The dependence of computability on numerical notations (Q6088491) (← links)