Representations versus numberings: On the relationship of two computability notions
From MaRDI portal
Publication:5958133
DOI10.1016/S0304-3975(00)00319-4zbMath0992.68056MaRDI QIDQ5958133
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
computability theorycomputable operatorscontinuity problemeffective operatorseffectively given topological spacesnumbering theorytheory of representationstype two theory of effectivity
Related Items (5)
Effective continuities on effective topological spaces ⋮ Some results related to the continuity problem ⋮ On the information carried by programs about the objects they compute ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic and fixed point equations over inverse limits of algebras
- Continuity and comprehension in intuitionistic formal systems
- Computability concepts for programming language semantics
- Classical recursion theory. Vol. II
- Computability on computable metric spaces
- Computable functionals of finite types
- On some decision problems in programming
- The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
- A Comparison of Five “Computable” Operators
- Discontinuities of provably correct operators on the provably recursive real numbers
- Effectively given domains and lambda-calculus models
- Church's thesis, continuity, and set theory
- Theorie der Numerierungen I
- The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations
- The unprovability in intuitionistic formal systems of the continuity of effective operations on the reals
- Theorie Der Numerierungen III
- On effective topological spaces
- An Effective Operator, Continuous but not Partial Recursive
- Algorithmic operators in constructive metric spaces
- Recursive metric spaces
- On Effectively Computable Operators
This page was built for publication: Representations versus numberings: On the relationship of two computability notions