Perspectives in Computation

Paperback (Print)
Buy New
Buy New from BN.com
$22.79
Used and New from Other Sellers
Used and New from Other Sellers
from $19.00
Usually ships in 1-2 business days
(Save 34%)
Other sellers (Paperback)
  • All (5) from $19.00   
  • New (4) from $27.23   
  • Used (1) from $19.00   

Overview


Computation is the process of applying a procedure or algorithm to the solution of a mathematical problem. Mathematicians and physicists have been occupied for many decades pondering which problems can be solved by which procedures, and, for those that can be solved, how this can most efficiently be done. In recent years, quantum mechanics has augmented our understanding of the process of computation and of its limitations.

Perspectives in Computation covers three broad topics: the computation process and its limitations, the search for computational efficiency, and the role of quantum mechanics in computation. The emphasis is theoretical; Robert Geroch asks what can be done, and what, in principle, are the limitations on what can be done? Geroch guides readers through these topics by combining general discussions of broader issues with precise mathematical formulations—as well as through examples of how computation works.

Requiring little technical knowledge of mathematics or physics, Perspectives in Computation will serve both advanced undergraduates and graduate students in mathematics and physics, as well as other scientists working in adjacent fields.

Read More Show Less

Product Details

  • ISBN-13: 9780226288550
  • Publisher: University of Chicago Press
  • Publication date: 8/31/2009
  • Series: Chicago Lectures in Physics Series
  • Pages: 208
  • Product dimensions: 6.00 (w) x 8.90 (h) x 0.50 (d)

Meet the Author


Robert Geroch is professor in the Department of Physics at the University of Chicago and author of General Relativity from A to B and Mathematical Physics, both published by the University of Chicago Press.
Read More Show Less

Table of Contents


1          Introduction
2          Characters and Strings
3          Problems
4          Computability
5          Turing Machines
6          Noncomputable Problems
7          Noncomputable Numbers
8          Formal Mathematics
9          Difficulty Functions
10        Difficult Problems; Best Algorithms
11        A Language for Efficiency
12        Are There Better Languages?
13        Probabilistic Computing
14        Quantum Mechanics
15        Grover Construction
16        Grover Construction: Six Issues
            16.1     Initial State
            16.2     Final Observation on Hin
            16.3     Building the Operator W
            16.4     Building the Operator V
            16.5     Errors
            16.6     What Is the Problem?
17        Quantum-Assisted Computing
18        Quantum-Assisted Computability
19        Quantum-Assisted Difficulty Functions
20        Quantum-Assisted Efficiency I
21        Quantum-Assisted Efficiency II
22        Conclusion
            References
            Index
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)