Hacker News new | ask | show | jobs
by eru 4034 days ago
To be pedantic: the Halting Problem for Turing Machines is undecidable. There are simpler computing models for which we can decide halting.