Title Statements
- Full title :Computable Functions
Summary
This lively and concise book is based on the lectures for undergraduates given by the authors at the Moscow State University Mathematics Department and covers the basic notions of the general theory of computation. It begins with the definition of a computable function and an algorithm and discusses decidability, enumerability, universal functions, numberings and their properties, $m$-completeness, the fixed point theorem, arithmetical hierarchy, oracle computations, and degrees of unsolvability. The authors also cover specific computational models, such as Turing machines and recursive functions. The intended audience includes undergraduate students majoring in mathematics or computer science, and all mathematicians and programmers who would like to learn the basics of the general theory of computation.
Read More ↓Edition Statements
- Publication Date:Dec. 2002
Publication Statements
- Publisher(s):American mathematical Society
- Place of Publication:Providence
- Language:rus
- Publication Date:Dec. 2002
The Physical Object
- Description:1 online resource
Edition Identifiers
- ISBN:9780821827321, 0821827324
- oclc:ocn907359285
- LC Classification:QA9.59.V47 2003
- Dewey Decimal:511.3
Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Files & Downloads
-
Computable Functions -- (.pdf)
PDF · 14.1 MB · updated -
Computable functions -- (.djvu)
DJVU · 1.2 MB · updated
Rate & Review