3 ms·Anything is possible with a Turing Complete solution.by unixhero 9y agoAnything is possible with a Turing Complete solution.toxicFork 9y agoEven the solution for the halting problem?Graham24 9y agomaybe, maybe not. Who can tell?gfredtech 9y agowell, 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.