Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Logic and discrete mathematics: a computer science perspective
Logic and discrete mathematics: a computer science perspective
Theory of computation: an introduction
Theory of computation: an introduction
Computer science (5th ed.): an overview
Computer science (5th ed.): an overview
Mathematical Structures for Computer Science
Mathematical Structures for Computer Science
Great Ideas in Computer Science: A Gentle Introduction
Great Ideas in Computer Science: A Gentle Introduction
New Turing Omnibus
Computer Science Illuminated
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Most Complex Machine: A Survey of Computers and Computing
Most Complex Machine: A Survey of Computers and Computing
| Hi-index | 0.00 |
In the ACM/IEEE 2001 curriculum guidelines, computability and its limitations are required topics, but Turing machines are not. However, most undergraduate textbooks that cover computability base their discussion on Turing machines, so in practice it is difficult to cover the required material on computability without also including elective material on Turing machines. This paper provides simple, classroom-tested techniques for teaching computability rigorously without reference to Turing machines or other theoretical topics. Even instructors who choose to include elective material on automata theory are likely to find this presentation simpler and more intuitive than traditional ones.