Abstract
The lexicographical and numerical orders on infinite signed-digit numerals are unrelated. However, we show that there is a computable normalization operation on pairs of signed-digit numerals such that for normal pairs the two orderings coincide. In particular, one can always assume without loss of generality that any two numerals that denote the same number are themselves the same. We apply the order-normalization operator to easily obtain an effective and sequential definition-by-cases scheme in which the cases consist of inequalities between real numbers.
Original language | English |
---|---|
Pages (from-to) | 53-68 |
Number of pages | 16 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 13 |
DOIs | |
Publication status | Published - 1998 |
Event | Comprox III, Third Workshop on Computation and Approximation - Birmingham, United Kingdom Duration: 11 Sept 1997 → 13 Sept 1997 |
Keywords
- Parallel conditional
- Real number computation
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science