✦ LIBER ✦

Computability of a map and decidability of its graph in the model of Blum, Shub and Smale

✍ Scribed by Corine Ceola; Pierre B.A. Lecomte

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 304 KB
Volume: 194
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00177-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Weak Version of the Blum, Shub, and Sm

A Weak Version of the Blum, Shub, and Smale Model

✍ Pascal Koiran 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 646 KB

We propose a weak version of the Blum Shub Smale model of computation over the real numbers. In this weak model only a ``moderate'' usage of multiplications and divisions is allowed. The class of boolean languages recognizable in polynomial time is shown to be the complexity class PÂpoly. The main t

Recursively enumerable subsets of Rq in

Recursively enumerable subsets of Rq in two computing models Blum-Shub-Smale machine and Turing machine

✍ Ning Zhong 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 997 KB

In this paper we compare recursively enumerable subsets of R" in two computing models over real numbers: the Blum-Shub-Smale machine and the oracle Turing machine. We prove that any Turing RE open subset of RY is a BSS RE set, while a Turing RE closed set may not be a BSS RE set. As an application

The minimum number of subgraphs in a gra

The minimum number of subgraphs in a graph and its complement

✍ Lane Clark 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB 👁 2 views

## Abstract For a graphb __F__ without isolated vertices, let __M__(__F__; __n__) denote the minimum number of monochromatic copies of __F__ in any 2‐coloring of the edges of __K__~__n__~. Burr and Rosta conjectured that when __F__ has order __t__, size __u__, and __a__ automorphisms. Independent

A computer modelling study of hydrogen b

A computer modelling study of hydrogen bonds in ligand-β-adrenoceptor complexes: its implications in the deduction of a receptor map

✍ Marcel R. Linschoten; Gert W. Klein Kranenbarg; Sjef J. de Kimpe; Jaap Wilting; 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 1002 KB

The path matrix of a graph, its construc

The path matrix of a graph, its construction and its use in evaluating certain products

✍ R.E. Roberson 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 728 KB

A generic intermittency model and its 1-

A generic intermittency model and its 1-D meta-map: Power laws, invariants and the succession of laminar sequences

✍ Rudolf M. Dünki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Intermittent behaviour has been found in many systems able to switch between two different dynamic states, e.g. between long laminar phases and short chaotic bursts. Despite the apparently high-dimensional complexity, certain one-dimensional (l-D) maps are known to mimic properties of such dynamics.