HN
Hacker News
Top
New
Best
Ask
Show
Jobs
Comment by unixhero | Hacker News Reader
Parent
Full thread
unixhero
·
Anything is possible with a Turing Complete solution.
View on HN
toxicFork
·
Even the solution for the halting problem?
Graham24
·
maybe, maybe not. Who can tell?
gfredtech
·
well, since the halting problem is undecidable, then no. One thing I still do not understand is how languages like Coq and Idris can almost always ensure that programs written in them terminate.
Reply on news.ycombinator.com