✦ LIBER ✦

On Effectively Computable Operators

✍ Scribed by John P. Helm

Publisher: John Wiley and Sons
Year: 1971
Tongue: English
Weight: 886 KB
Volume: 17
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19710170127

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computable operators on regular sets

✍ Martin Ziegler 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB

## Abstract For regular sets in Euclidean space, previous work has identified twelve ‘basic’ computability notions to (pairs of) which many previous notions considered in literature were shown to be equivalent. With respect to those basic notions we now investigate on the computability of natural o

A Comparison of Five “Computable” Operat

A Comparison of Five “Computable” Operators

✍ Marian Boykan Pour-El 📂 Article 📅 1960 🏛 John Wiley and Sons 🌐 English ⚖ 785 KB

Computability of compact operators on co

Computability of compact operators on computable Banach spaces with bases

✍ Vasco Brattka; Ruth Dillhage 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

## Abstract We develop some parts of the theory of compact operators from the point of view of computable analysis. While computable compact operators on Hilbert spaces are easy to understand, it turns out that these operators on Banach spaces are harder to handle. Classically, the theory of compac

The Minimal Euclidean Norm of an Algebra

The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable

✍ M. Filaseta; M.L. Robinson; F.S. Wheeler 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 868 KB

Computable choice functions for computab

Computable choice functions for computable linear orderings

✍ Manuel Lerman; Richard Watnick 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 351 KB

## Abstract A choice set for a computable linear ordering is a set which contains one element from each maximal block of the ordering. We obtain a partial characterization of the computable linear order‐types for which each computable model has a computable choice set, and a full characterization i

Computational complexity on computable m

Computational complexity on computable metric spaces

✍ Klaus Weirauch 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 344 KB

## Abstract We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a gene