- 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.
- Lake Washington Ship Canal (seattle.gov)
The grand opening of the Lake Washington Ship Canal was held on July 4, 1917. Designed by Seattle district engineer Hiram Chittenden of the U.S. Army Corps of Engineers, the canal’s construction was the result of more than five decades of discussion on how to connect the saltwater of Puget Sound to the freshwater of Lake Washington via Lake Union. Early planners envisioned heavy use by coal and naval vessels, but today the locks are predominantly filled with pleasure crafts. The City of Seattle’s role included engineering, legal, and public works projects as new bridges, roads, water supply infrastructure and more were required to accommodate the implications of the Ship Canal on Seattle’s shape and size. The exhibits below provide insight into how the Ship Canal shaped Seattle’s social, physical, and environmental history.
- 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.