Takashi's Notes

Home

❯

courses

❯

theory of computation lecture notes

❯

Proving problems are not solvable in a model of computation

Proving problems are not solvable in a model of computation

Nov 21, 20251 min read

Proving problems are not solvable in a model of computation

Prev: 06-equivalence-of-models Next: 08-turing-machines

Prev: 06-equivalence-of-models Next: 08-turing-machines


Graph View

Backlinks

  • Equivalence of models
  • Turing machines

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Discord Community