Computable functions
Based on the lectures for undergraduates at Moscow State University, this book presents a lively and concise introduction to the central facts and 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, the fixed point theorem, arithmetical hierarchy, oracle computations, and degrees.
Read More ↓Title Statements
- Full title :Computable functions / A. Shen, N.K. Vereshchagin ; translated [from the Russian] by V.N. Dubrovskii.
Summary
Based on the lectures for undergraduates at Moscow State University, this book presents a lively and concise introduction to the central facts and 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, the fixed point theorem, arithmetical hierarchy, oracle computations, and degrees.
Read More ↓Edition Statements
- Publication Date:2003
Publication Statements
- Publisher(s):American mathematical Society
- Place of Publication:Providence (Rhode Island)
- Language:eng
- Publication Date:2003
Notes
Índice.
The Physical Object
- Description:V, 166 p. ; : 22 cm.
Edition Identifiers
- ISBN:0821827324, 9780821827321
- oclc:ocn641434157
- LC Classification:QA9.59
Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Related Works
more →
Computing in accelerator design and operation: proceedings of the Europhysics Conferen…
Europhysics Conference, Berlin)
Rate & Review