Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-08T14:16:42.687Z Has data issue: false hasContentIssue false

Introduction

Published online by Cambridge University Press:  24 March 2017

Marian B. Pour-El
Affiliation:
University of Minnesota
J. Ian Richards
Affiliation:
University of Minnesota
Get access

Summary

This book deals with computable analysis. The subject, as its name suggests, represents a marriage between analysis and physics on the one hand, and comput-ability on the other. Computability, of course, brings to mind computers, which are playing an ever larger role in analysis and physical theory. Thus it becomes useful to know, at least theoretically, which computations in analysis and physics are possible and which are not.

In this book, we attempt to develop a coherent framework for solving problems in this area. We will see that a variety of questions in computable analysis can be answered within this framework. For example, we will deal with computability for classical analysis, mathematical physics, Hilbert and Banach spaces, bounded and unbounded linear operators, eigenvalues and eigenvectors, and a variety of other topics. All of these are dealt with from the viewpoint of recursion theory, the theory of computability as treated in mathematical logic. Classical recursion theory provides a definition of computable function from integers to integers. Starting from this, the book develops corresponding notions of computability for real numbers, continuous functions, Hilbert space, Lp-spaces, and, more generally, arbitrary Banach spaces.

The framework used in this book is axiomatic. We axiomatize the notion of a “computability structure” on a Banach space. This allows a variety of applications to be treated under one heading. It is worth mentioning that the concept axio-matized is “computable sequence of vectors” of the Banach space. Then a point x is computable if the sequence x, x, x,… is computable. However, it is natural, and in fact necessary, to deal with sequences rather than individual points. For sequences lie at the center, both of recursion theory and analysis. A cornerstone of recursion theory is the notion of a recursive function, which is nothing more than a computable sequence of integers. In analysis, the topology on a Banach space is given by sequences.

We turn now to a discussion of some of the principal results in the book. These results are contained in Parts II and III. (We will discuss the contents of the more elementary Part I below.) There are three key results, the First and Second Main Theorems and the Eigenvector Theorem.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Introduction
  • Marian B. Pour-El, University of Minnesota, J. Ian Richards, University of Minnesota
  • Book: Computability in Analysis and Physics
  • Online publication: 24 March 2017
  • Chapter DOI: https://doi.org/10.1017/9781316717325.004
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Introduction
  • Marian B. Pour-El, University of Minnesota, J. Ian Richards, University of Minnesota
  • Book: Computability in Analysis and Physics
  • Online publication: 24 March 2017
  • Chapter DOI: https://doi.org/10.1017/9781316717325.004
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Introduction
  • Marian B. Pour-El, University of Minnesota, J. Ian Richards, University of Minnesota
  • Book: Computability in Analysis and Physics
  • Online publication: 24 March 2017
  • Chapter DOI: https://doi.org/10.1017/9781316717325.004
Available formats
×