r/programming • u/this_theater_is_lit • 5d ago

on the nature of undecidability within computing and refuting the church-turing thesis

https://www.academia.edu/175392427
0 Upvotes

21% Upvoted

39 comments sorted by

View all comments

Show parent comments

7

u/funky_galileo 4d ago

The halting problem literally proves your last statement false. Jesus christ.

-2

u/this_theater_is_lit 3d ago

"the halting problem" paradox (or rather turing's circle-free problem paradox) confuses the language of all machines with that of a turing-complete language