# Exact real arithmetic

### From HaskellWiki

EndreyMark (Talk | contribs) (→Why, are there reals at all, which are defined exactly, but are not computable?: Writing on Chaitin's construct and John Tromp's combinatory logic-related article) |
EndreyMark (Talk | contribs) (Decoding function can be made a total function: with Maybe) |
||

Line 32: | Line 32: | ||

Now, Chatin's construct will be here | Now, Chatin's construct will be here | ||

− | :<math>\sum_{p\in | + | :<math>\sum_{p\in \mathrm{Rng}_\mathrm{dc},\;\mathrm{hnf}\left(\mathrm{dc}\;p\right)} 2^{-\left|p\right|}</math> |

− | where <math>\mathrm{hnf}</math> should denote an unary predicate “has normal form” (“terminates”) | + | where |

+ | ;<math>\mathrm{hnf}</math> | ||

+ | :should denote an unary predicate “has normal form” (“terminates”) | ||

+ | ;<math>\mathrm{dc}</math> | ||

+ | :should mean an operator “decode” (a function from bit finite bit sequences to [[combinatory logic]] terms) | ||

+ | ;<math>2\!\;^{*}</math> | ||

+ | :should denote the set of all finite bit sequences | ||

+ | ;<math>\mathrm{Rng}_\mathrm{dc}</math> | ||

+ | :should denote the range of decoding function, e.g. the syntactically correct bit sequences (semantically, they may either terminate or diverge), | ||

+ | ;“Absolut value” | ||

+ | :should mean the length of a bit sequence (not [[combinatory logic]] term evaluation!) | ||

+ | |||

+ | Here, <math>\mathrm{dc}</math> is a partial function (from finite bit sequences). If this is confusing, then we can choose a more Haskell-like approach, making <math>\mathrm{dc}</math> a total function: | ||

+ | <haskell> | ||

+ | dc :: [Bit] -> Maybe CL | ||

+ | </haskell> | ||

+ | then, Chaitin's construct will be | ||

+ | :<math>\sum_{p\in 2^*,\;\mathrm{maybe}\;\downarrow\;\mathrm{hnf}\left(\mathrm{dc}\;p\right)} 2^{-\left|p\right|}</math> | ||

+ | where <math>\downarrow</math> should denote false truth value. | ||

== Theory == | == Theory == |

## Revision as of 10:47, 3 August 2006

## Contents |

## 1 Introduction

Exact real arithmetic is an interesting area: it is a deep connection between

- numeric methods
- and deep theoretic fondations of algorithms (and mathematics).

Its topic: computable real numbers raise a lot of interesting questions rooted in mathematical analysis, arithmetic, but also Computability theory (see numbers-as-programs approaches).

Computable reals can be achieved by many approaches -- it is not one single theory.

### 1.1 What it is *not*

Exact real arithmetic is not the same as *fixed* arbitrary precision reals (see `Precision(n)`

of Yacas).

Exact reals must allow us to run a huge series of computations, prescribing only the precision of the end result. Intermediate computations, and determining their necessary precision must be achieved automatically, dynamically.

Maybe another problem, but it was that lead me to think on exact real arithmetic: using some Mandelbrot-plotting programs, the number of iterations must be prescribed by the user at the beginning. And when we zoom too deep into these Mandelbrot worlds, it will become ragged or smooth. Maybe solving this particular problem does not need necessarily the concept of exact real arithmetic, but it was the first time I began to think on such problems.

See other numeric algorithms at Libraries and tools/Mathematics.

### 1.2 Why, are there reals at all, which are defined exactly, but are not computable?

See Wikipedia article on Chaitin's construction, referring to e.g.

- Computing a Glimpse of Randomness (written by Cristian S. Calude, Michael J. Dinneen, and Chi-Kou Shu)
- Omega and why math has no TOEs (Gregory Chaitin).

Some more direct relatedness to functional programming: we can base Ω on combinatory logic (instead of a Turing machine), see the prefix coding system dscribed in Binary Lambda Calculus and Combinatory Logic (page 20) written by John Tromp:

of course, *c*, *d* are metavariables, and also some other notations are changed slightly.

Now, Chatin's construct will be here

where

- hnf
- should denote an unary predicate “has normal form” (“terminates”)
- dc
- should mean an operator “decode” (a function from bit finite bit sequences to combinatory logic terms)
- should denote the set of all finite bit sequences
- Rng
_{dc} - should denote the range of decoding function, e.g. the syntactically correct bit sequences (semantically, they may either terminate or diverge),
- “Absolut value”
- should mean the length of a bit sequence (not combinatory logic term evaluation!)

Here, dc is a partial function (from finite bit sequences). If this is confusing, then we can choose a more Haskell-like approach, making dc a total function:

dc :: [Bit] -> Maybe CL

then, Chaitin's construct will be

where should denote false truth value.

## 2 Theory

Jean Vuillemin's Exact real computer arithmetic with continued fractions is very good article on the topic itself. It can serve also as a good introductory article, too, because it presents the connections to both mathematical analysis and Computability theory. It discusses several methods, and it describes some of them in more details.

Martín Escardó's project A Calculator for Exact Real Number Computation -- its chosen functional language is Haskell, mainly because of its purity, lazyness, presence of lazy lists, pattern matching.

Martín Escardó has many exact real arithetic materials also among his many papers.

## 3 Portal-like homepages

### 3.1 Exact Computation

There are functional programming materials too, even with downloadable Haskell source.

### 3.2 ExactRealArithmetic

This HaWiki article provides links to many implementations.