✦ LIBER ✦

Real Computations with Fake Numbers

✍ Scribed by Felipe Cucker

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 201 KB
Volume: 18
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.2001.0607

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Monotonically Computable Real Numbers

✍ Robert Rettinger; Xizhong Zheng; Romain Gengler; Burchard von Braunmühl 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB

Weakly Computable Real Numbers

✍ Klaus Ambos-Spies; Klaus Weihrauch; Xizhong Zheng 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 161 KB

h-monotonically computable real numbers

✍ Xizhong Zheng; Robert Rettinger; George Barmpalias 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB

Sequential real number computation and r

Sequential real number computation and recursive relations

✍ J. Raymundo Marcial-Romero; M. Andrew Moshier 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

## Abstract In the first author's thesis [10], a sequential language, LRT, for real number computation is investigated. That thesis includes a proof that all polynomials are programmable, but that work comes short of giving a complete characterization of the expressive power of the language even fo

Real Number Computations: On the Use of

Real Number Computations: On the Use of Information

✍ Klaus Meer 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Snarks with given real flow numbers

✍ Robert Lukot'ka; Martin Škoviera 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

We show that for each rational number r such that 4<r ≤ 5 there exist infinitely many cyclically 4-edge-connected cubic graphs of chromatic index 4 and girth at least 5-that is, snarks-whose flow number equals r. This answers a question posed by Pan and Zhu [Construction of graphs with given circula