9780821827321 - computable functions (student mathematical library) de shen, a (7 resultados)
- Tapa blanda
Librería: Zubal-Books, Since 1961, Cleveland, OH, Estados Unidos de AmericaZubal-Books, Since 1961
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 23,27
Envío por EUR 3,85Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: 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.
- Tapa blanda
Librería: Better World Books: West, Reno, NV, Estados Unidos de AmericaBetter World Books: West
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 29,10
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: 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.
- Tapa blanda
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino UnidoPhatpocket Limited
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Aceptable
EUR 35,44
Envío por EUR 12,44Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Condición: 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.
- Tapa blanda
Librería: Rarewaves.com USA, London, LONDO, Reino UnidoRarewaves.com USA
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 61,29
Gastos de envío gratisSe envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: 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 computa…ble 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.
- Tapa blanda
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de AmericaKennys Bookstore
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 93,48
Envío por EUR 8,99Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: 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.
- Tapa blanda
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 108,89
Envío por EUR 9,50Se envía de Irlanda a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: 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. . . . .
- Tapa blanda
Librería: Rarewaves.com UK, London, Reino UnidoRarewaves.com UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 58,13
Envío por EUR 75,97Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: 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 computa…ble 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.
