Back to topics

Could a program always tell whether another program will stop?

Watching a program run is not always enough to know whether it will eventually stop. The halting problem asks for something stronger: a checker that always finishes and answers correctly for every program and input. A carefully constructed self-reference shows why that universal promise is impossible, even though many particular programs can be checked.

5–7 min

Questions you could explore

  • What useful promises could a software checker make if it cannot answer every possible case?

Start reading

Ready to try your ideas aloud?

Your topic carries over. Record up to 2½ minutes, depending on your plan.

Computers and AI

Why can a damaged QR code still work?

A scratch or stain does not always stop a QR code from being read. Its stored information includes redundancy, but that does not mean any part of the image can be covered without consequence.

3–5 min
Computers and AI

How does a website name become an internet address?

You remember a website by its name, while the network needs an address for the connection. DNS supplies that translation, sometimes from a saved answer and sometimes by asking other servers.

4–5 min
Computers and AI

Same emoji, different picture

The same emoji can arrive with a different expression or style from the one you saw when sending it. Unicode identifies characters and sequences, while software platforms choose artwork and decide what their versions support.

2–3 min
Could a program always tell whether another program will stop? | Speech Topic | speaking.app