9780821827321 - computable functions. (student mathematical library, vol.19) von a. shen; nikolai konstantinovich vereshchagin (8 Ergebnisse)
- Softcover
Anbieter: Zubal-Books, Since 1961, Cleveland, OH, USAZubal-Books, Since 1961
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 21,19
EUR 3,86 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: Very Good. 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.
- Softcover
Anbieter: Better World Books: West, Reno, NV, USABetter World Books: West
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 29,38
Versand gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: 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.
- Softcover
Anbieter: Phatpocket Limited, Waltham Abbey, HERTS, Vereinigtes KönigreichPhatpocket Limited
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Befriedigend
EUR 35,44
EUR 12,44 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Zustand: 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.
- Softcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 45,51
EUR 11,69 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Paperback. Zustand: Brand New. 166 pages. 8.50x5.75x0.50 inches. In Stock.
- Softcover
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes KönigreichRarewaves.com USA
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 61,36
Versand gratisVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Paperback. Zustand: 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 computabl…e 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.
- Softcover
Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 93,60
EUR 9,00 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: 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, a…nd 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.
- Softcover
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandKennys Bookshop and Art Galleries Ltd.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 108,89
EUR 9,50 VersandVersand von Irland nach USAAnzahl: 1 verfügbar
Zustand: 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, a…nd 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. . . . .
- Softcover
Anbieter: Rarewaves.com UK, London, Vereinigtes KönigreichRarewaves.com UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 58,14
EUR 75,97 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Paperback. Zustand: 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 computabl…e 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.
