Computable Real Analysis
MacLennan, Bruce J.
MetadataShow full item record
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.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
NPS Report NumberNPS52-84-024
Showing items related by title, author, creator and subject.
Williams, R. T.; Schoenstadt, A. L. (Monterey, California. Naval Postgraduate School, 1980-01); NPS63-80-001This report compares three finite element formulations of the linearized shallow-water equations which are applied to the geostrophic adjustment process. The three corresponding finite difference schemes are also included ...
Kaiser, Michael John (Monterey, California. Naval Postgraduate School, 1981-03);Finite element, elastic and plastic analyses of various aluminum panels, containing holes and notches, were conducted for comparison with photoelastic experimental results. A FORTRAN IV program, ADINA (Automatic Dynamic ...
Williams, Roger Terry (Monterey, California. Naval Postgraduate School, 1978); NPS63-78-006In this report the Galerkin method is presented and the spectral and finite element methods are shown to be special cases of the general method. The spectral and finite methods are applied to a simple linear equation and ...