✦ LIBER ✦

Approximation representations for reals and their wtt-degrees

✍ Scribed by George Barmpalias

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 190 KB
Volume: 50
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.200310105

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We study the approximation properties of computably enumerable reals. We deal with a natural notion of approximation representation and study their wtt‐degrees. Also, we show that a single representation may correspond to a quite diverse variety of reals. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

📜 SIMILAR VOLUMES

Exact and Approximate Riemann Solvers fo

Exact and Approximate Riemann Solvers for Real Gases

✍ Richard Saurel; Michel Larini; Jean Claude Loraud 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Approximations for Constant e and Their

Approximations for Constant e and Their Applications

✍ Xiaojing Yang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 86 KB

Infrastructure for the representation of

Infrastructure for the representation of events and their contexts

✍ Michael K. Buckland; Ray R. Larson 📂 Article 📅 2007 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 35 KB

## Abstract The design of information storage and retrieval systems has traditionally privileged persons and topics (“subjects”). Persons are important both as creators and as topics, but the focus has been personal identity and, through Name Authority Files, the disambiguation of different persons

Interchange Theorems for Hypergraphs and

Interchange Theorems for Hypergraphs and Factorization of Their Degree Sequences

✍ A.A. Chernyak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 124 KB

The aim of this paper is to unify interchange theorems and extend them to hypergraphs. To this end sufficient conditions for equality of the l 1 -distance between equivalence classes and the l 1 -distance between corresponding order-type functions are provided. The generality of this result is demon

Hybridizing nested dissection and halo a

Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering

✍ Pellegrini, Fran�ois; Roman, Jean; Amestoy, Patrick 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 2 views

Minimum degree and nested dissection are the two most popular reordering schemes used to reduce fillin and operation count when factoring and solving sparse matrices. Most of the state-of-the-art ordering packages hybridize these methods by performing incomplete nested dissection and ordering by min

Community as practice: social representa

Community as practice: social representations of community and their implications for health promotion

✍ Christine Stephens 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 1 views