𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rationality, computability, and complexity

✍ Scribed by Berc Rustem; Kumaraswamy Velupillai

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
824 KB
Volume
14
Category
Article
ISSN
0165-1889

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lp-Computability
Lp-Computability
✍ Ning Zhong; Bing-Yu Zhang πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 434 KB

In this paper we investigate conditions for LP-computability which are in ac- cordance with the classical Grzegorczyk notion of computability for a continuous function. For a given computable real number p 2 1 and a compact computable rectangle I c Rq, we show that an Lp function f E L p ( I ) is LP

Tensor Products and Computability
Tensor Products and Computability
✍ Eric Bach πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 326 KB

We consider the problem of computability in tensor products of modules over a ring. We exhibit a finite local ring \(A\) and a pair of \(A\)-modules, given explicitly by generators and relations, with the following property. The operations in each module are computable in polynomial time, but equali

Computability and continuity in metric p
Computability and continuity in metric partial algebras equipped with computability structures
✍ Fredrik Dahlgren πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 251 KB

## Abstract In this paper we give an axiomatisation of the concept of a computability structure with partial sequences on a many‐sorted metric partial algebra, thus extending the axiomatisation given by Pour‐El and Richards in [9] for Banach spaces. We show that every Banach‐Mazur computable partia