Computable Real Analysis,
Abstract
We present a model of the real numbers that is completely finitistic. Every real number is represented by a finite structure-specifically, a finite sequence of symbols from a finite alphabet. All of the arithmetic operations on reals are also finite and can be evaluated on a computer. We allow nothing that cannot be described by a finite algorithm-whether numbers or sequences or functions. This development is carried through the fundamental theorem of calculus. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1984
- Accession Number
- ADA149079
Entities
People
- B. J. Maclennan
Organizations
- Naval Postgraduate School