Buy Computability and Complexity by Neil Deaton Jones
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Computability and Complexity: From a Programming Perspective(Foundations of Computing)
Computability and Complexity: From a Programming Perspective(Foundations of Computing)

Computability and Complexity: From a Programming Perspective(Foundations of Computing)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impenetrability. Neil Jones's goal as an educator and author is to build a bridge between computability and complexity theory and other areas of computer science, especially programming. In a shift away from the Turing machine- and Gödel number-oriented classical approaches, Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists and more applicable to practical programming problems. According to Jones, the fields of computability and complexity theory, as well as programming languages and semantics, have a great deal to offer each other. Computability and complexity theory have a breadth, depth, and generality not often seen in programming languages. The programming language community, meanwhile, has a firm grasp of algorithm design, presentation, and implementation. In addition, programming languages sometimes provide computational models that are more realistic in certain crucial aspects than traditional models. New results in the book include a proof that constant time factors do matter for its programming-oriented model of computation. (In contrast, Turing machines have a counterintuitive "constant speedup" property: that almost any program can be made to run faster, by any amount. Its proof involves techniques irrelevant to practice.) Further results include simple characterizations in programming terms of the central complexity classes PTIME and LOGSPACE, and a new approach to complete problems for NLOGSPACE, PTIME, NPTIME, and PSPACE, uniformly based on Boolean programs. Foundations of Computing series

Table of Contents:
Part 1 Toward the theory: introduction; the WHILE language; programs as data objects. Part 2 Introduction to computability: self-interpretation - universal program for WHILE and I; elements of computability theory; metaprogramming, self-application, and compiler generation; other sequential models of computation; robustness of computability; computability by functional languages (partly by T.AE. Mongensen); some natural unsolvable problems. Part 3 Other aspects of computability theory: Hilbert's tenth problem (by M.H. Sorensen); inference systems and Godel's incompleteness theorem; computability theory based on numbers; more abstract approaches to computability . Part 4 Introduction to complexity: overview of complexity theory; measuring time usage; time usage of tree-manipulating programs; robustness of time-bounded computation; linear and other time hierarchies for WHILE programs; the existence of optimal algorithms (by A>M> Ben-Amram); space-bounded computations; nondeterministic computations; a structure for classifying the complexity of various problems; characterizations of LOGSPACE and PTIME by GOTO programs. Part 5 Complete problems: completeness and reduction of one problem to another; complete problems for PTIME; complete problems for NPTIME; complete problems for PSPACE. Part 6 Appendix: a mathematical terminology and concepts.

About the Author :
Neil Deaton Jones is a retired Professor of Computer Science at the University of Copenhagen.

Review :
"Neil Jones is one of the precious few computer scientists with greatexpertise and leadership roles in both formal methods and complexity.This makes his book especially valuable." Yuri Gurevich, Professor of Computer Science, University of Michigan


Best Sellers


Product Details
  • ISBN-13: 9780262100649
  • Publisher: MIT Press Ltd
  • Publisher Imprint: MIT Press
  • Height: 229 mm
  • No of Pages: 484
  • Series Title: Foundations of Computing
  • Spine Width: 36 mm
  • Weight: 1134 gr
  • ISBN-10: 0262100649
  • Publisher Date: 23 Jan 1997
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Series Title: Computability and Complexity
  • Sub Title: From a Programming Perspective
  • Width: 180 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Computability and Complexity: From a Programming Perspective(Foundations of Computing)
MIT Press Ltd -
Computability and Complexity: From a Programming Perspective(Foundations of Computing)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Computability and Complexity: From a Programming Perspective(Foundations of Computing)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!