Abstract
The goal of this course is to understand the foundations of computation. We will ask some very basic questions, such as
-
What does it mean for a function to be computable?
-
Are there any noncomputable functions?
-
How does computational power depend on programming constructs?
-
a useful feature of the book: the exercises
These questions may appear simple, but they are not. They have intrigued scientists for decades, and the subject is still far from closed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1997). Course Roadmap and Historical Perspective. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1844-9_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1844-9_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7309-7
Online ISBN: 978-1-4612-1844-9
eBook Packages: Springer Book Archive