Takashi's Notes

❯

❯

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

May 30, 20231 min read

Proving problems are not solvable in a model of computation

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

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

Graph View

Backlinks

Equivalence of models
Turing machines

Created with Quartz v4.5.1 © 2025

Homepage
GitHub
RSS
Sitemap