Verwandte Artikel zu Computable Functions. (Student Mathematical Library,...
Inhaltsangabe
Shen and Vereshchagin base this text on lectures presented at the Moscow State U. Mathematics Dept., for which they select central notions and facts from the general theory of algorithms. Coverage includes computable functions, decidable and enumerable sets; universal functions and undecidability; numberings and operations; properties of G÷del numberings; fixed point theorem; m -reducibility and properties of enumerable sets; oracle computations; arithmetical hierarchy; Turing machines; arithmeticity of computable functions; and recursive functions. For undergraduate mathematics or computer science majors, mathematicians and programmers. Translated from Russian by V. N. Dubrovskii. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Suchergebnisse für Computable Functions. (Student Mathematical Library,...
Beispielbild für diese ISBN
Computable Functions (Student Mathematical Library, Vol. 19) (Student Mathematical Library, V. 19)
Verlag:
Amer Mathematical Society, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
Gebraucht
Softcover
Anbieter: Zubal-Books, Since 1961, Cleveland, OH, USA
Verkäuferbewertung 5 von 5 Sternen
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. Bestandsnummer des Verkäufers ZB1353282
Gebraucht kaufen
EUR 23,27
EUR 3,85 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Computable Functions
Verlag:
American Mathematical Society, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
Gebraucht
Softcover
Anbieter: Better World Books: West, Reno, NV, USA
Verkäuferbewertung 5 von 5 Sternen
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. Bestandsnummer des Verkäufers 13761076-6
Gebraucht kaufen
EUR 29,10
Versand gratis
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Computable Functions (Student Mathematical Library, Vol. 19)
Verlag:
Amer Mathematical Society, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
Gebraucht
Softcover
Anbieter: Phatpocket Limited, Waltham Abbey, HERTS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
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. Bestandsnummer des Verkäufers Z1-B-017-02002
Gebraucht kaufen
EUR 35,44
EUR 12,44 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Computable Functions
Verlag:
American Mathematical Society, US, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
Neu
Paperback
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
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 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. Bestandsnummer des Verkäufers LU-9780821827321
Neu kaufen
EUR 61,29
Versand gratis
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Computable Functions (Student Mathematical Library, Vol. 19) (Student Mathematical Library, V. 19)
Anbieter: Kennys Bookstore, Olney, MD, USA
Verkäuferbewertung 5 von 5 Sternen
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, 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. Bestandsnummer des Verkäufers V9780821827321
Neu kaufen
EUR 93,48
EUR 8,99 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Computable Functions (Student Mathematical Library, Vol. 19) (Student Mathematical Library, V. 19)
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Verkäuferbewertung 5 von 5 Sternen
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, 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. . . . . Bestandsnummer des Verkäufers V9780821827321
Neu kaufen
EUR 108,89
EUR 9,50 Versand
Versand von Irland nach USA
Versand von Irland nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Computable Functions
Verlag:
American Mathematical Society, US, 2002
ISBN 10: 0821827324
ISBN 13: 9780821827321
Neu
Paperback
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
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 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. Bestandsnummer des Verkäufers LU-9780821827321
Neu kaufen
EUR 58,13
EUR 75,97 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar