Items related to Computable Functions (Student Mathematical Library)
Synopsis
In 1936, before the development of modern computers, Alan Turing proposed the concept of a machine that would embody the interaction of mind, machine, and logical instruction. The idea of a 'universal machine' inspired the notion of programs stored in a computer's memory. Nowadays, the study of computable functions is a core topic taught to mathematics and computer science undergraduates. 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, $m$-completeness, the fixed point theorem, arithmetical hierarchy, oracle computations, and degrees of unsolvability. The authors complement the main text with over 150 problems. They 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 computer scientists who would like to learn basics of the general theory of computation. The book is also an ideal reference source for designing a course.
"synopsis" may belong to another edition of this title.
Search results for Computable Functions (Student Mathematical Library)
Stock Image
Computable Functions (Student Mathematical Library, Vol. 19) (Student Mathematical Library, V. 19)
Published by
Amer Mathematical Society, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
Used
Softcover
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Seller rating 5 out of 5 stars
Condition: Very Good. *Price HAS BEEN REDUCED by 10% until Monday, Aug. 24 (SALE item)* 166 pp., Paperback, very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Seller Inventory # ZB1353282
Stock Image
Computable Functions
Published by
American Mathematical Society, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
Used
Softcover
Seller: Better World Books: West, Reno, NV, U.S.A.
Seller rating 5 out of 5 stars
Condition: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Seller Inventory # 13761076-6
Stock Image
Computable Functions (Student Mathematical Library, Vol. 19)
Published by
Amer Mathematical Society, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
Used
Softcover
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Seller Inventory # Z1-B-017-02002
Buy Used
£ 29.44
£ 10.64 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Seller Image
Computable Functions
Published by
American Mathematical Society, US, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
New
Paperback
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. In 1936, before the development of modern computers, Alan Turing proposed the concept of a machine that would embody the interaction of mind, machine, and logical instruction. The idea of a 'universal machine' inspired the notion of programs stored in a computer's memory. Nowadays, the study of computable functions is a core topic taught to mathematics and computer science undergraduates. 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, $m$-completeness, the fixed point theorem, arithmetical hierarchy, oracle computations, and degrees of unsolvability. The authors complement the main text with over 150 problems. They 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 computer scientists who would like to learn basics of the general theory of computation. The book is also an ideal reference source for designing a course. Seller Inventory # LU-9780821827321
Buy New
£ 52.44
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Computable Functions (Student Mathematical Library, Vol. 19) (Student Mathematical Library, V. 19)
Published by
Amer Mathematical Society, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
New
Softcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Based on the lectures for undergraduates at Moscow State University, this book offers an 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, and degrees of unsolvability. Series: Student Mathematical Library. Num Pages: 166 pages, bibliography, glossary, index. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 200. Weight in Grams: 227. . 2002. Paperback. . . . . Books ship from the US and Ireland. Seller Inventory # V9780821827321
Stock Image
Computable Functions (Student Mathematical Library, Vol. 19) (Student Mathematical Library, V. 19)
Published by
Amer Mathematical Society, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
New
Softcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. Based on the lectures for undergraduates at Moscow State University, this book offers an 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, and degrees of unsolvability. Series: Student Mathematical Library. Num Pages: 166 pages, bibliography, glossary, index. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 200. Weight in Grams: 227. . 2002. Paperback. . . . . Seller Inventory # V9780821827321
Seller Image
Computable Functions
Published by
American Mathematical Society, US, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
New
Paperback
Seller: Rarewaves.com UK, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. In 1936, before the development of modern computers, Alan Turing proposed the concept of a machine that would embody the interaction of mind, machine, and logical instruction. The idea of a 'universal machine' inspired the notion of programs stored in a computer's memory. Nowadays, the study of computable functions is a core topic taught to mathematics and computer science undergraduates. 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, $m$-completeness, the fixed point theorem, arithmetical hierarchy, oracle computations, and degrees of unsolvability. The authors complement the main text with over 150 problems. They 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 computer scientists who would like to learn basics of the general theory of computation. The book is also an ideal reference source for designing a course. Seller Inventory # LU-9780821827321
Buy New
£ 48.29
£ 65 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available