= 27d567bc2d48d9f40e9ccc20ea370b15)
snarles comments on No one knows what Peano arithmetic doesn't know - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (52)
So is PA the weakest system capable of encapsulating Turing logic?
No. You don't need induction to do so. You can just use arithmetic to slowly, slowly evaluate the TM until you find something that halts or don't. The oracle holds all the power.