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: ThriftBooks-Dallas, Dallas, TX, USA
Paperback. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Bestandsnummer des Verkäufers G0821827324I4N00
Anzahl: 1 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 166 pages. 8.50x5.75x0.50 inches. In Stock. Bestandsnummer des Verkäufers 0821827324
Anzahl: 1 verfügbar