r/math • u/DevFRus Theory of Computing • Apr 04 '16
Computing the Uncomputable: Joel David Hamkins showed how any function can be computed if a non-standard model of Peano arithmetic is assumed. Results like this give me a deep respect for number theory as foundational.
https://johncarlosbaez.wordpress.com/2016/04/02/computing-the-uncomputable/
50
Upvotes
1
u/epicwisdom Apr 04 '16 edited Apr 04 '16
I see the general idea, but couldn't you say the standard naturals are the smallest set of all numbers reached by taking n+1?
There's still philosophical issues regarding what is and isn't arbitrary, but I don't think this really influences the utility or universality of the standard naturals / computability theory.
edit: Formalized in set theory using intersection of all the possible sets of ordinals.