Computability in an Introductory Course on Programming
| Venue: | Bulletin of the European Association for Theoretical Computer Science 73 (2001 |
| Citations: | 2 - 1 self |
BibTeX
@INPROCEEDINGS{Schneider_computabilityin,
author = {Hans J. Schneider},
title = {Computability in an Introductory Course on Programming},
booktitle = {Bulletin of the European Association for Theoretical Computer Science 73 (2001},
year = {},
pages = {153}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The programming approach to computability presented in the textbook by Kfoury, Moll, and Arbib in 1982 has been embedded into a programming course following the textbook by Abelson and Sussman. This leads to a course concept teaching good programming practice and clear theoretical concepts simultaneously. Here, we explain some of the main points of this approach: the halting problem, primitive and -recursive functions and the operational counterpart of these functions, i.e., the Loop and the While programs. 1
Citations
| 57 | General recursive functions of natural numbers, Mathematische Annalen 112 - Kleene - 1936 |
| 31 | The complexity of loop programs - Meyer, Ritchie - 1967 |
| 2 | Structure and Interpretation of Computer Programs - Second Edition - J - 1996 |
| 1 | Arbib: A Programming Approach to Computability - A |
| 1 | Noncomputability is easy to understand - Morales-Bueno - 1995 |
| 1 | et al.: Two classical theorems revisited - Morales-Bueno - 2000 |
| 1 | An impossible program, Letter to the Editor - Strachey - 1965 |
