- Turing kicked us out of Heaven (buttondown.com)
The halting problem is “undecidable”: there’s no algorithm which can tell you if an arbitrary program with an arbitrary input will halt or not. IE, if you give me a proposed “halt-detector”, I can inspect it and come up with a program and input for which it would give the wrong answer.
- Potlatch, Idaho (Wikipedia)
Potlatch is a city in the northwest United States, located in north central Idaho in Latah County, about six miles (10 km) east of the border with Washington. On the Palouse north of Moscow, it is served by State Highway 6, and bordered on the northeast by the small community of Onaway. As of the 2020 census, Potlatch had a population of 763.
- Halting problem (Wikipedia)
In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. The halting problem is undecidable, meaning that no general algorithm exists that solves the halting problem for all possible program–input pairs. The problem comes up often in discussions of computability since it demonstrates that some functions are mathematically definable but not computable.