𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing topological degree using noisy information

✍ Scribed by Misako Yokoyama

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
335 KB
Volume
6
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

✦ Synopsis

This paper addresses the problem of computing topological degree of Lipschitz functions with the use of noisy evaluations of function values as information. Two bounds on the noise are considered: (i) absolute and (ii) relative. We identify upper bounds with both noise bounds. They are extensions of some results in (Boult, T., and Sikorski, K. ( 1986), Complexity of computing topological degree of Lipschitz functions in n dimensions, J. Complexity 2, 44-59).

πŸ“œ SIMILAR VOLUMES

On Turing degrees of points in computabl
On Turing degrees of points in computable topology
✍ Iraj Kalantari; Larry Welch πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 169 KB

## Abstract This paper continues our study of computable point‐free topological spaces and the metamathematical points in them. For us, a __point__ is the intersection of a sequence of basic open sets with compact and nested closures. We call such a sequence a __sharp filter__. A function __f~F~__

Using music to communicate computing inf
Using music to communicate computing information
✍ Paul Vickers; James L Alty πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 330 KB

The audio channel remains little used in most computing applications, often its use being relegated to providing trivial sound effects whose novelty value soon wears off. Nevertheless, in principle sound offers much to the process of humanΒ±computer interaction as for most people the notion of audito