Answers are grounded in this paper and cite their sources.
Analysis addresses doubts about computability in numerical functions and mathematical philosophy.
Juliette Kennedy’s new book reminds us that some have claimed that the existence of so-called deviant encodings or numeral systems raises doubts about the wide acceptance of “Church’s thesis” understood as the identification of computability with recursiveness for numerical functions. It is argued that if responses to such doubts, by Stewart Shapiro and others, in the literature do not already suffice to dispel such doubts, attention to careful discussions, by Charles Parsons and others, of ontological issues in philosophy of mathematics should be more than enough to do so.
No takes yet. Share an insight, caveat, or question.
John P Burgess (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: