Cited By
View all- Kilpeläinen P(2010) Do all roads lead to Rome? ( Or reductions for dummy travelers) Computer Science Education10.1080/08993408.2010.50122620:3(181-199)Online publication date: Sep-2010
Constructive reduction: understanding uncomputability through programming
Authors: 
Jesús Ibáñez, Ana SánchezAuthors Info & Claims
Jesús Ibáñez, Ana SánchezAuthors Info & ClaimsPages 90 - 94
Abstract
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.
References
[1]
ACM/AIS/IEE-CS Task Force. Computing Curriculum 2005.
[2]
Brookshear, J. G. Theory of Computation. Formal Languages, Automata, and Complexity. Benjamin-Cummings, 1989.
[3]
Cutland, N.J. Computability: An introduction to recursive function theory. Cambridge University Press, 1980.
[4]
Davis M.D., Weyuker, E. J. Computability, Complexity and Languages. Academic Press, 1983.
[5]
Dunne, P. E. Computability Theory. Concepts and Applications. Ellis Horword, 1991.
[6]
Hermes, H. Enumerability, Decidability, Computability. Springer, 1965.
[7]
Hopcroft J.E., Motwani R., Ullman J.D. Introduction to Automata Theory, Languages, and Computation. Addison Wesley; 3 edition 2006.
[8]
Kfoury, A.J., Moll, R. N., Arbib M.A. A programming approach to computability. New York, Springer-Verlag, 1982.
[9]
Lewis H., Papadimitriou C.H. Elements of the theory of computation Prentice-Hall second edition, 1997.
[10]
Lowther J.L., Shene C. Toward an intuitive and interesting theory course: the first step of a road map. Journal of Computing Science in colleges, 20, 1, (October 2004).
[11]
Mallozzi, J.S., Lillo, de N. J. Computability with Pascal. Prentice-Hall, 1984.
[12]
Moret B.M.E. The Theory of Computation. Addison-Wesley, Reading, MA, 1998.
[13]
Rich, E. Automata, Computability and Complexity. Pearson Prentice Hall, 2008.
[14]
Smith, C.H. A Recursive Introduction to the Theory of Computation, Springer-Verlag, 1994.
[15]
Soare R.I. Recursively Enumerable Sets and Degress, Springer-Verlag, 1987.
[16]
Sigman S. Engaging Students in Formal Language Theory and Theory of Computation. ACM SIGCSE Bulletin, 39, 1, (March 2007).
[17]
The Liberal Arts Computer Science Consortium. A 2004 model for a liberal arts degree in computer science. February 2004.
Index Terms
- Constructive reduction: understanding uncomputability through programming
Recommendations
Size reduction of multitape automata
CIAA'05: Proceedings of the 10th international conference on Implementation and Application of AutomataWe present a method for size reduction of two-way multitape automata. Our algorithm applies local transformations that change the order in which transitions concerning different tapes occur in the automaton graph, and merge suitable states into a single ...
On size reduction techniques for multitape automata
Implementation and application of automataWe present a method for size reduction of two-way multitape automata. Our algorithm applies local transformations that change the order in which transitions concerning different tapes occur in the automaton graph, and merge suitable states into a single ...
One-Turn Regulated Pushdown Automata and Their Reduction
This paper discusses some simple and natural restrictions of regulated pushdown automata, whose moves are regulated by some control languages. Most importantly, it studies one-turn regulated pushdown automata and proves that they characterize the family ...
Comments
Information & Contributors
Information
Published In
Copyright © 2009 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 June 2009
Published in SIGCSE Volume 41, Issue 2
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 72Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
Cited By
View all- Kilpeläinen P(2010) Do all roads lead to Rome? ( Or reductions for dummy travelers) Computer Science Education10.1080/08993408.2010.50122620:3(181-199)Online publication date: Sep-2010
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in