Computability with Pascal
Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Theory of computation: formal languages, automata, and complexity
Theory of computation: formal languages, automata, and complexity
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
Elements of the Theory of Computation
Elements of the Theory of Computation
The Theory of Computation
Programming Approach to Computability
Programming Approach to Computability
Toward an intutive and interesting theory course: the first step of a road map
Journal of Computing Sciences in Colleges
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Engaging students in formal language theory and theory of computation
Proceedings of the 38th SIGCSE technical symposium on Computer science education
| Hi-index | 0.00 |
We present a programming approach to teach the reduction technique in a computing engineering degree's Computability Theory course. It is based in a computing formalism that allows the students to analyze, construct and transform programs as normal data in a simple way. Reduction can then be tackled in a constructive manner, so that the students benefit from their programming skills to prove uncomputability results without the help of the Parametrization (S-m-n) Theorem. Additionally the method is suitable to be applied to interesting problems that cannot be handled by diagonalization nor classical reduction.