Computability with Pascal
Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
American Mathematical Monthly
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
A recursive introduction to the theory of computation
A recursive introduction to the theory of computation
Programming Approach to Computability
Programming Approach to Computability
Theory of Computation
Constructive reduction: understanding uncomputability through programming
ACM SIGCSE Bulletin
| Hi-index | 0.01 |
This paper presents the first step of an attempt in designing intuitive and interesting materials for a theory course. The materials developed cover the AL5 Basic Computability unit of the ACM/IEEE Computing Curricula 2001, and can be used in a stand-alone theory course. This paper describes a "programming approach" to basic computability. Topics include a proof of the Halting Problem and the use of a simple reduction technique to prove other interesting problems. Details of the chosen computation model, the construction of a universal program, and the Isomorphism Theorem are also discussed. Future topics for this course include advanced computability, computability with real numbers, and the connection between theory and programming languages.