Name
Abstract | ||
|---|---|---|
There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these representations yield the same class of real numbers. If we work with some restricted notion of computability, e.g., polynomial time computability or primitive recursive computability, they do not. This phenomenon has been investigated over the last seven decades by Specker [13], Mostowski [8], Lehman [10], Ko [3, 4], Labhalla and Lombardi [9], Georgiev [1], Kristiansen [5, 6] and quite a few more. Georgiev et al. [2] is an extended version of the current paper.Irrational numbers can be represented by infinite sums. Sum approximations from below and above were introduced in Kristiansen [ 5] and studied further in Kristiansen [ 6]. Every irrational number (alpha ) |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-94418-0_20 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Primitive recursive function,Series (mathematics),Approximations of π,Computability,Irrational number,Cauchy sequence,Real number,Mathematics,Dedekind cut | Conference | 10936 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivan Georgiev | 1 | 17 | 7.56 |
| Lars Kristiansen | 2 | 78 | 8.00 |
| Frank Stephan | 3 | 49 | 3.79 |