Re: Contradicrtion-free mathemattics (The new nonstandard analysis
- From: matthias@xxxxxxxxxxx
- Date: 29 Jan 2006 18:00:04 -0800
E. E. Escultura
>A decimal is known by its digits. Therefore, it exists or is known or well-defined if every
>digit is known or computable. Being computable means there is an algorithm or rule or
>scheme for computing each digit or determining it uniquely from the basic
>integers 0, 1, . . ., 9. Since computation is a finite process, the set of such algorithms is finite.
This is clearly false. For each positive integer n there is a
completely explicit, concrete algoprithm for producing the decimal
expanion of the square root of n. Thus there are infinitely many
``decimals'' (which is your word for decimal expansions of real
numbers) and infinitely many ``such algorithms.''
Note that this does not depend on classical logic in any way. Both
Bishop and Brouwer would agree that the set of algorithms which produce
decimal expansions is infinite.
.
- Follow-Ups:
- Re: Contradicrtion-free mathemattics (The new nonstandard analysis
- From: E. E. Escultura
- Re: Contradicrtion-free mathemattics (The new nonstandard analysis
- From: Virgil
- Re: Contradicrtion-free mathemattics (The new nonstandard analysis
- References:
- Re: Contradicrtion-free mathemattics (The new nonstandard analysis
- From: Robert J. Kolker
- Re: Contradicrtion-free mathemattics (The new nonstandard analysis
- From: E. E. Escultura
- Re: Contradicrtion-free mathemattics (The new nonstandard analysis
- Prev by Date: Hexpentaquaternions: a two-hand quaternion algebra
- Next by Date: Derivate OFa number
- Previous by thread: Re: Contradicrtion-free mathemattics (The new nonstandard analysis
- Next by thread: Re: Contradicrtion-free mathemattics (The new nonstandard analysis
- Index(es):
Relevant Pages
|