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.
Anbieter: Zubal-Books, Since 1961, Cleveland, OH, USA
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. Artikel-Nr. ZB1353282
Anzahl: 1 verfügbar
Anbieter: Better World Books: West, Reno, NV, USA
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. Artikel-Nr. 13761076-6
Anzahl: 1 verfügbar
Anbieter: Phatpocket Limited, Waltham Abbey, HERTS, Vereinigtes Königreich
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. Artikel-Nr. Z1-B-017-02002
Anzahl: 2 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
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. Artikel-Nr. V9780821827321
Anzahl: 1 verfügbar