News for hackers. Stuff that matters.

A comment on Braid is undecidable (2014) [pdf]. Parent comment

Re:Braid is undecidable (2014) [pdf] by eru on Wednesday June 03, 2015 @12:12AM (#9650541)
To be pedantic: the Halting Problem for Turing Machines is undecidable. There are simpler computing models for which we can decide halting.
[ Parent | on HN ]

There are no comments on this comment yet.