- 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.
- Sydney (Wikipedia)
Sydney (/ˈsɪdni/ SID-nee) is the capital city of the state of New South Wales, and the most populous city in Australia. Located on Australia’s east coast, the metropolis surrounds Sydney Harbour and extends about 70 km (43.5 mi) towards the Blue Mountains to the west, Hawkesbury to the north, the Royal National Park and Macarthur to the south and south-west. Greater Sydney consists of 658 suburbs, spread across 33 local government areas. Residents of the city are colloquially known as “Sydneysiders”. The estimated population on June 2022 was 5,297,089; the city is home to approximately 66% of the state’s population. Notable nicknames of the city include the “Emerald City” and the “Harbour City”.