Skip to content

Comment on A gentle introduction to automated reasoningparent

Comments

Seems to me a case of people vaguely remembering long gone concepts from their university years.

The halting problem stipulates that it's impossible to have an algorithm that takes any program and decides if it halts. It doesn't say that there could be certain subclasses of programs for which such a procedure could exist.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.