# The Halting Problem

DevFeed: [The Halting Problem](<https://devfeed.tech/articles/the-halting-problem-40751.md>)

Original publisher: [Read original article](<https://radek.io/posts/the-halting-problem/>)

Published: 2014-07-27T00:00:00Z

Content type: article

Language: en

Sources: [Radek Pazdera](<https://devfeed.tech/sources/radek-pazdera.md>)

Topics: [Computer science](<https://devfeed.tech/topics/computer-science.md>), [Algorithm](<https://devfeed.tech/topics/algorithm.md>), [Math and Logic](<https://devfeed.tech/topics/math-and-logic.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [computer-science](<https://devfeed.tech/tags/computer-science.md>), [computers](<https://devfeed.tech/tags/computers.md>), [halting-problem](<https://devfeed.tech/tags/halting-problem.md>), [infinite](<https://devfeed.tech/tags/infinite.md>), [input](<https://devfeed.tech/tags/input.md>), [logic](<https://devfeed.tech/tags/logic.md>), [loops](<https://devfeed.tech/tags/loops.md>), [program](<https://devfeed.tech/tags/program.md>), [reduction](<https://devfeed.tech/tags/reduction.md>)

## AI overview

The article explains Alan Turing's halting problem: no general method can always determine whether an arbitrary program will halt or run forever. It describes the problem's connection to undecidability, diagonalization, and reductions, and briefly discusses Turing's work with Alonzo Church.

## Source excerpt

And other things computers cannot solve