9783030832018 - computability de tourlakis, george (24 resultados)
- Tapa dura
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 87,89
Envío por EUR 2,30Se envía dentro de Estados Unidos de AmericaCantidad disponible: 3 disponibles
Condición: New.
- Tapa dura
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de AmericaPBShop.store US
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 90,28
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.
- Tapa dura
Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 83,65
Envío por EUR 8,89Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.
- Tapa dura
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 94,09
Envío por EUR 2,30Se envía dentro de Estados Unidos de AmericaCantidad disponible: 3 disponibles
Condición: As New. Unread book in perfect condition.
- Tapa dura
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 83,64
Envío por EUR 17,49Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Condición: New.
- Tapa dura
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de AmericaGrand Eagle Retail
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 102,62
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: new. Hardcover. This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of c…omputing. Beginning with an introduction to the mathematisation of mechanical process using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarskis theorem on the non-representability of truth, Goedels incompleteness and Rossers incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Churchs thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oraclecomputations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blums complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
- Tapa dura
Librería: Chiron Media, Wallingford, Reino UnidoChiron Media
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 86,10
Envío por EUR 18,06Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: New.
- Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 91,73
Envío por EUR 13,96Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
- Tapa dura
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 93,80
Envío por EUR 17,49Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Condición: As New. Unread book in perfect condition.
- Tapa dura
Librería: Speedyhen, Hertfordshire, Reino UnidoSpeedyhen
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 75,11
Envío por EUR 47,79Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: NEW.
- Más imágenes
- Tapa dura
Librería: Rarewaves.com USA, London, LONDO, Reino UnidoRarewaves.com USA
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 125,04
Gastos de envío gratisSe envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardback. Condición: New. 2021 ed. This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of comp…uting. Beginning with an introduction to the mathematisation of "mechanical process" using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarski's theorem on the non-representability of truth, Goedel's incompleteness and Rosser's incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church's thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oraclecomputations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum's complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.
- Tapa dura
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 142,04
Envío por EUR 3,48Se envía dentro de Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. 1st ed. 2022 edition NO-PA16APR2015-KAP.
- Más imágenes
Idioma: Inglés
Editorial: Springer, Berlin|Springer International Publishing|Springer, 2021
- Tapa dura
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 95,15
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: New. This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and invest.
- Más imágenes
Idioma: Inglés
Editorial: Springer International Publishing, Springer International Publishing, 2022
- Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 96,29
Envío por EUR 65,78Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investi…gate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of 'mechanical process' using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs.Advanced chapters cover the Ackerman function, Tarski's theorem on the non-representability of truth, Goedel's incompleteness and Rosser's incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church's thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oraclecomputations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum's complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.
- Tapa dura
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 149,53
Envío por EUR 17,49Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Hardcover. Condición: Brand New. 664 pages. 9.25x6.10x1.61 inches. In Stock.
- Tapa dura
Librería: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 154,68
Envío por EUR 32,27Se envía de Australia a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: new. Hardcover. This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of c…omputing. Beginning with an introduction to the mathematisation of mechanical process using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarskis theorem on the non-representability of truth, Goedels incompleteness and Rossers incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Churchs thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oraclecomputations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blums complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
- Más imágenes
- Tapa dura
Librería: Rarewaves.com UK, London, Reino UnidoRarewaves.com UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 117,70
Envío por EUR 75,77Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardback. Condición: New. 2021 ed. This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of comp…uting. Beginning with an introduction to the mathematisation of "mechanical process" using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarski's theorem on the non-representability of truth, Goedel's incompleteness and Rosser's incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church's thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oraclecomputations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum's complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.
- Tapa dura
- Impresión bajo demanda
Librería: Basi6 International, Irving, TX, Estados Unidos de AmericaBasi6 International
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 92,18
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 10 disponibles
Condición: Brand New. New. Delivery takes 20-25 days. Print on Demand.
- Más imágenes
- Tapa dura
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 96,29
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational proce…sses and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of 'mechanical process' using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs.Advanced chapters cover the Ackerman function, Tarski's theorem on the non-representability of truth, Goedel's incompleteness and Rosser's incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church's thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oracle computations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum's complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions. 668 pp. Englisch.
- Tapa dura
- Impresión bajo demanda
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 107,21
Envío por EUR 17,49Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: Brand New. 664 pages. 9.25x6.10x1.61 inches. In Stock. This item is printed on demand.
- Tapa dura
- Impresión bajo demanda
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 143,63
Envío por EUR 7,58Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand.
- Más imágenes
- Tapa dura
- Impresión bajo demanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 84,50
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Buch. Condición: Neu. Computability | George Tourlakis | Buch | xxvii | Englisch | 2022 | Springer | EAN 9783030832018 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
- Tapa dura
- Impresión bajo demanda
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 146,93
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. PRINT ON DEMAND.
- Más imágenes
- Tapa dura
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 96,29
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes… and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of 'mechanical process' using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs.Advanced chapters cover the Ackerman function, Tarski's theorem on the non-representability of truth, Goedel's incompleteness and Rosser's incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church's thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oraclecomputations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum's complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 668 pp. Englisch.
