Takashi's Notes

Home

❯

courses

❯

theory of computation lecture notes

❯

Equivalence of models

Equivalence of models

Nov 21, 20251 min read

Equivalence of models

Prev: 05-closure-of-language-classes-under-set-operations Next: 07-proving-problems-are-not-solvable-in-a-model-of-computation

Prev: 05-closure-of-language-classes-under-set-operations Next: 07-proving-problems-are-not-solvable-in-a-model-of-computation


Graph View

Backlinks

  • Closure of language classes under set operations
  • Proving problems are not solvable in a model of computation

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Discord Community