𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recursion and Computability over Topological Structures

✍ Scribed by Vasco Brattka

Book ID
108498450
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
29 KB
Volume
40
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

CFT and topological recursion
CFT and topological recursion
✍ Ivan Kostov; Nicolas Orantin πŸ“‚ Article πŸ“… 2010 πŸ› Springer-Verlag 🌐 English βš– 630 KB
Discrete structures, logic, and computab
Discrete structures, logic, and computability
✍ James L. Hein πŸ“‚ Library πŸ“… 1995 πŸ› Jones and Bartlett 🌐 English βš– 6 MB

This text introduces the beginning computer science student to some of the fundamental ideas and techniques used by computer scientists today, focusing on discrete structures, logic and computability. The emphasis is on the computational aspects, so that the reader can see how the concepts are ac

Analog computers and recursive functions
Analog computers and recursive functions over the reals
✍ Daniel Silva GraΓ§a; JosΓ© FΓ©lix Costa πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 235 KB

In this paper we show that Shannon's general purpose analog computer (GPAC) is equivalent to a particular class of recursive functions over the reals with the flavour of Kleene's classical recursive function theory. We first consider the GPAC and several of its extensions to show that all these mod

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