✦ LIBER ✦

Dynamical representation of real numbers and its universality

✍ Scribed by William M.Y Goh

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 892 KB
Volume: 33
Category: Article
ISSN: 0022-314X
DOI: 10.1016/0022-314x(89)90068-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Representation of the positive real numb

Representation of the positive real numbers as sums of colored rational numbers

✍ J.-M Brochet 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Representations of the real numbers and

Representations of the real numbers and of the open subsets of the set of real numbers

✍ Klaus Weihrauch; Christoph Kreitz 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 859 KB

On the continued fraction representation

On the continued fraction representation of computable real numbers

✍ Ker-I Ko 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 858 KB

Compact DAG Representation and Its Dynam

Compact DAG Representation and Its Dynamic Scheduling

✍ Michel Cosnard; Emmanuel Jeannot 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 355 KB

Scheduling large task graphs is an important issue in parallel computing. In this paper we tackle the two following problems: (1) how to schedule a task graph, when it is too large to fit into memory? (2) How to build a generic program such that parameter values of a task graph can be given at run-t

Weak computability and representation of

Weak computability and representation of reals

✍ Xizhong Zheng; Robert Rettinger 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract The computability of reals was introduced by Alan Turing [20] by means of decimal representations. But the equivalent notion can also be introduced accordingly if the binary expansion, Dedekind cut or Cauchy sequence representations are considered instead. In other words, the computabil

Recursive Approximability of Real Number

Recursive Approximability of Real Numbers

✍ Xizhong Zheng 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 359 KB

A real number is recursively approximable if there is a computable sequence of rational numbers converging to it. If some extra condition to the convergence is added, then the limit real number might have more effectivity. In this note we summarize some recent attempts to classify the recursively ap