In case of interval (or more general) uncertainty, no algorithm can choose the simplest representative (Q1611215)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: In case of interval (or more general) uncertainty, no algorithm can choose the simplest representative |
scientific article; zbMATH DE number 1785581
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | In case of interval (or more general) uncertainty, no algorithm can choose the simplest representative |
scientific article; zbMATH DE number 1785581 |
Statements
In case of interval (or more general) uncertainty, no algorithm can choose the simplest representative (English)
0 references
21 August 2002
0 references
It is shown that there is no algorithm which picks out the simplest number or the simplest computable number of a given interval. The proof is related to a formalized first-order logic in which Peano arithmetic and an elementary theory of reals is definable. Simplest number means a number which can be defined by a formula of minimum length, where the length of a formula is mainly the weighted number of symbols in the formula.
0 references
simplest representative
0 references
interval uncertainty
0 references
simplest computable number
0 references
first-order logic
0 references
Peano arithmetic
0 references
