UID:
almahu_9948025691102882
Format:
1 online resource (192 p.)
Edition:
1st edition
ISBN:
1-282-95515-2
,
9786612955150
,
0-12-384959-4
Content:
This textbook is designed to introduce undergraduate mathematics and computer science students to computability theory (recursion theory). It is based on teaching experience, and is designed to be accessible to junior and senior students without a previous background in the subject.
Note:
Bibliographic Level Mode of Issuance: Monograph
,
1. The Computability Concept; 2. General Recursive Functions; 3. Programs and Machines; 4. Recursive Enumerability; 5. Connections to Logic; 6. Degrees of Unsolvability; 7. Polynomial-Time Computability; Appendix: Mathspeak; Appendix: Countability; Appendix: Decadic Notation;
,
English
Additional Edition:
ISBN 0-12-384958-6
Language:
English
