Computability
What can be computed at all — Turing machines, decidability, undecidability.
Models of computation, the Church-Turing thesis, decidability and undecidability, and the halting problem.
What can be computed at all — Turing machines, decidability, undecidability.
Models of computation, the Church-Turing thesis, decidability and undecidability, and the halting problem.