Notes

Home

❯

Mathematics

❯

Theoretical Computer Science

❯

Computability Theory

❯

Halting Problem

Halting Problem

Jan 07, 20251 min read

It is impossible to predict whether an arbitrary program on an arbitrary archiecture will or will not halt during the duration of its execution This is proved by contradiction.


Graph View

Backlinks

  • Branching
  • Computability Theory

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Discord Community