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.
Language: English
Published by Reston Publishing, Reston, Virginia, 1984
Seller: MK Book Store, Mission, BC, Canada
First Edition
Hardcover. 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.
Language: English
Published by Wiley-Interscience, USA, 2008
ISBN 10: 0470280743 ISBN 13: 9780470280744
Seller: Qwertyword Ltd, Okehampton, DEVON, United Kingdom
First Edition
Hardcover. Condition: Near Fine. 1st Edition. UNUSED. Purchase date note in ink on front flyleaf (Bought in Blackwell's Oxford on Thursday 8th January 2009 for £50.50) . Ripples to surface film along the spine. Clean crisp and bright.
Seller: Books From California, Simi Valley, CA, U.S.A.
hardcover. Condition: Very Good.
Condition: New.
Language: English
Published by Springer International Publishing AG, Cham, 2024
ISBN 10: 303130487X ISBN 13: 9783031304873
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condition: new. Hardcover. This book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. Safe that is, paradox-free informal set theory is introduced following on the heels of Russells Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantors diagonalisation technique. Predicate logic for the user is introduced along with axioms and rules and extensive examples. Partial orders and the minimal condition are studied in detail with the latter shown to be equivalent to the induction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions of functions and sets. Techniques for solving recurrence relations including generating functions, the O- and o-notations, and trees are provided. Over 200 end of chapter exercises are included to further aid in the understanding and applications of discrete mathematics. This book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. 1st ed. 2024 edition NO-PA16APR2015-KAP.
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New.
Hardcover. Condition: New. 1st Edition. Brand new, ship fast with USPS tracking No. Please understand we will not accept return for any reasons. Thanks.
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New.
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 271 pages. 9.45x6.61x0.83 inches. In Stock.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2003
ISBN 10: 0521753740 ISBN 13: 9780521753746
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Good. Volume 2. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:9780521753746.
Language: English
Published by Cambridge University Press, 2010
ISBN 10: 0521168465 ISBN 13: 9780521168465
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2010
ISBN 10: 0521168465 ISBN 13: 9780521168465
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2010
ISBN 10: 0521168465 ISBN 13: 9780521168465
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Condition: New.
Language: English
Published by Springer Nature Switzerland AG, Cham, 2023
ISBN 10: 303083204X ISBN 13: 9783030832049
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
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 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, 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.
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2010
ISBN 10: 0521168465 ISBN 13: 9780521168465
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 55.93
Quantity: Over 20 available
Add to basketCondition: New. In.
Language: English
Published by Cambridge University Press 2006-09-08, 2006
ISBN 10: 0521168465 ISBN 13: 9780521168465
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New.
Language: English
Published by Cambridge University Press, 2010
ISBN 10: 0521168465 ISBN 13: 9780521168465
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
£ 61.04
Quantity: Over 20 available
Add to basketCondition: New. In.
Condition: New. Satisfaction Guaranteed or your money back.
Language: English
Published by Cambridge University Press, 2006
ISBN 10: 0521168465 ISBN 13: 9780521168465
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. This two-volume set bridges the gap between introductory texts and the research literature. Series: Cambridge Studies in Advanced Mathematics. Num Pages: 342 pages, black & white illustrations. BIC Classification: PBCD; PBCH. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 229 x 152 x 19. Weight in Grams: 500. . 2006. paperback. . . . .
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 271 pages. 9.45x6.61x0.83 inches. In Stock.
Condition: New.
Condition: New.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.