- 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.
- Nooksack River § Middle Fork (Wikipedia)
The Middle Fork Nooksack River, about 20 miles (32 km) long, originates on the southern slopes of Mount Baker near Baker Pass. It flows generally northwest between Mount Baker and Twin Sisters, and drains into the North Fork opposite Welcome, about 4.5 km (2.8 mi) northeast of the confluence between the North and South Forks.
