Talk:Imapl

Why exactly would Imapl be uncomputable? SuperJedi224 (talk) 16:27, 11 November 2015 (UTC)

Thanks for the observation, I just noticed that it actually isn't. Since every program halts in a finite number of steps, valid programs can be executed by a turing machine by brute forcing every possible value for the constants.

My initial reasoning was that, since the final state of each variable is avaliable as soon as the program starts, turing completeness would imply that you'd be able to determine whether a turing machine halts in finite time. However, there is no way to test whether some machine halts without generating an error or to reliably determine if an operation would result in an error if executed. --Lemon enthusiast (talk) 14:38, 12 November 2015 (UTC)