Let (DS, DQ, sim) be a retrieval system consisting of a document space DS, a query space QS, and a function sim, expressing the similarity between a document and a query. Following D. M. Everett and S. C. Cater (1992), we introduce topologies on the document space. These topologies are generated by
Topological aspects of numberings
β Scribed by Wolfram Menzel; Frank Stephan
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 330 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We investigate connections between the syntactic and semantic distance of programs on an abstract, recursion theoretic level. For a certain rather restrictive notion of interdependency of the two kinds of distances, there remain only few and βunnaturalβ numberings allowing such close relationship. Weakening the requirements leads to the discovery of universal metrics such that for an arbitrary recursively enumerable family of functions a numbering compatible with such a metric can uniformly be constructed. We conclude our considerations with some implications on learning theory.
π SIMILAR VOLUMES
Research in recent years has revealed that the construct of fuzzy topological spaces behaves quite differently from that of topological spaces with respect to certain categorical properties. In this paper we discuss some of these aspects. Since the topological construct L-FTS contains nontrivial bot
Sum ma ry ## Site-spec@ recombination events are of fundamental importance in many biological systems. In vitro experiments using purified proteins and D N A substrates are yielding insights into strand exchange mechanisms and synapsis of recombination sites. By examining results across a range o
The topological aspects of the conformational transformations in proteins are investigated using a new peptide-ribbon representation of the tertiary structure. The topological parameters evaluated on a set of 49 proteins show striking regularities that extend beyond the secondary structures actually
## Dedicated to Klaus Weihrauch on the occasion of his 60th birthday. The different behaviour of total and partial numberings with respect to the reducibility preorder is investigated. Partial numberings appear quite naturally in computability studies for topological spaces. The degrees of partial