Computable Functions - Brossura

Vereshchagin, Nikolai Konstantinovich; Shen, A.

Brossura

ISBN 10: 0821827324 ISBN 13: 9780821827321

Casa editrice: Amer Mathematical Society, 2002

Riassunto

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)

Su questo libro

Product Description

Book by Nikolai Konstantinovich Vereshchagin A Shen

Dettagli dell'edizione

• Editore: Amer Mathematical Society
• Data di pubblicazione: 2002
• Lingua: Inglese
• ISBN 10: 0821827324
• ISBN 13: 9780821827321
• Rilegatura: Copertina flessibile
• Numero di pagine: 166
• Contatto del produttore: non disponibile
• Persona responsabile: Ufficio Anagrafiche Messaggerie; ufficio.anagrafiche@meli.it; ; Via Verdi, 8; Assago Milano; 20090; Italia