Computability by Tourlakis George (43 results)
- Hardcover
Seller: Better World Books Ltd, Dunfermline, United KingdomBetter World Books Ltd
Contact seller5-star sellerCondition: Used - Good
£ 12.41
£ 5.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
More imagesLanguage: English
Published by Reston Publishing, Reston, Virginia 1984
- Hardcover
- First Edition
Seller: MK Book Store, Mission, CanadaMK Book Store
Contact seller5-star sellerCondition: Used - Good
£ 15.46
£ 11.17 shippingShips from Canada to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Good. 1st Edition. 'Computability' by George J. Tourlakis (York University / Atkinson College). Reston Publishing Company (a Prentice-Hall company), 1984. A rigorous introduction to the theory of computable and recursive functions. Dark blue cloth hardcover with copper spine/front lettering, issued without…dust jacket. Binding sound; the front board has a scar/abrasion and a small corner chip, with general rubbing; text block clean. A Good copy of the scarce original edition.
- Softcover
Seller: GreatBookPrices, Columbia, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
£ 61.53
£ 1.97 shippingShips within U.S.A.Quantity: 2 available
Condition: New.
- Softcover
Seller: Grand Eagle Retail, Bensenville, U.S.A.Grand Eagle Retail
Contact seller5-star sellerCondition: New
£ 63.56
Free ShippingShips within U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. 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.
- Softcover
Seller: GreatBookPrices, Columbia, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
£ 67.24
£ 1.97 shippingShips within U.S.A.Quantity: 2 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 61.04
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: SHIMEDIA, Brooklyn, U.S.A.SHIMEDIA
Contact seller5-star sellerCondition: New
£ 76.70
Free ShippingShips within U.S.A.Quantity: 1 available
Condition: New. Satisfaction Guaranteed or your money back.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
£ 59.97
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Condition: New.
- Hardcover
Seller: GreatBookPrices, Columbia, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
£ 76.78
£ 1.97 shippingShips within U.S.A.Quantity: 3 available
Condition: New.
- Hardcover
Seller: PBShop.store US, Wood Dale, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
£ 78.82
Free ShippingShips within U.S.A.Quantity: 1 available
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Hardcover
Seller: PBShop.store UK, Fairford, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
£ 69.67
£ 7.63 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Hardcover
Seller: GreatBookPrices, Columbia, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
£ 80.93
£ 1.97 shippingShips within U.S.A.Quantity: 3 available
Condition: As New. Unread book in perfect condition.
- Hardcover
Seller: Speedyhen LLC, Hialeah, U.S.A.Speedyhen LLC
Contact seller2-star sellerCondition: New
£ 83.92
Free ShippingShips within U.S.A.Quantity: 2 available
Condition: NEW.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
£ 67.01
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Condition: As New. Unread book in perfect condition.
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
£ 69.66
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: 5 available
Condition: New.
- Hardcover
Seller: Grand Eagle Retail, Bensenville, U.S.A.Grand Eagle Retail
Contact seller5-star sellerCondition: New
£ 87.64
Free ShippingShips within U.S.A.Quantity: 1 available
Hardcover. Condition: 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.
- Hardcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
£ 71.71
£ 15.49 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: New.
- Softcover
Seller: Books Puddle, New York, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 87.13
£ 2.97 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 668.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 76.40
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
£ 78.11
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: 5 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 87.68
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Paperback. Condition: Brand New. 664 pages. 9.25x6.10x1.57 inches. In Stock.
- Hardcover
Seller: Speedyhen, Hertfordshire, United KingdomSpeedyhen
Contact seller5-star sellerCondition: New
£ 62.55
£ 41.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: NEW.
- Hardcover
Seller: Rarewaves.com USA, London, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
£ 107.04
Free ShippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardback. Condition: 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.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 56.81
£ 60.52 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Computability | George Tourlakis | Taschenbuch | xxvii | Englisch | 2023 | Springer | EAN 9783030832049 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Language: English
Published by Springer International Publishing, Springer Nature Switzerland 2023
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 61.93
£ 56.18 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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…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.
- Hardcover
Seller: Books Puddle, New York, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 120.62
£ 2.97 shippingShips within U.S.A.Quantity: 4 available
Condition: New. 1st ed. 2022 edition NO-PA16APR2015-KAP.
- Softcover
Seller: AussieBookSeller, Truganina, AustraliaAussieBookSeller
Contact seller5-star sellerCondition: New
£ 99.25
£ 27.56 shippingShips from Australia to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. 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.
Language: English
Published by Springer, Berlin|Springer International Publishing|Springer 2021
- Hardcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 84.73
£ 42.36 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: 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.
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 123.21
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 664 pages. 9.25x6.10x1.61 inches. In Stock.
Language: English
Published by Springer International Publishing, Springer International Publishing 2022
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 85.75
£ 56.88 shippingShips from Germany to U.S.A.Quantity: 2 available
Buch. Condition: 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.
