𝔖 Bobbio Scriptorium
✦   LIBER   ✦

One method of analysis of turing computations. III

✍ Scribed by V. A. Moshchenskii

Publisher
Springer US
Year
1987
Tongue
English
Weight
580 KB
Volume
23
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ 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~__

Turing degrees of hypersimple relations
Turing degrees of hypersimple relations on computable structures
✍ Valentina S. Harizanov πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 175 KB

Let A be an inΓΏnite computable structure, and let R be an additional computable relation on its domain A. The syntactic notion of formal hypersimplicity of R on A, ΓΏrst introduced and studied by Hird, is analogous to the computability-theoretic notion of hypersimplicity of R on A, given the deΓΏnabil