Algorithmic operators in constructive metric spaces

DOI10.1090/trans2/064/01zbMath0183.01602OpenAlexW4255811391MaRDI QIDQ5573970

G. S. Citin

Publication date: 1967

Published in: Nine Papers on Logic and Group Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/trans2/064/01

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (13)

Algebraic types in PER models ⋮ Effective inseparability in a topological setting ⋮ Some results related to the continuity problem ⋮ On the information carried by programs about the objects they compute ⋮ An abstract data type for real numbers ⋮ On the Continuity of Effective Multifunctions ⋮ Total sets and objects in domain theory ⋮ Church's thesis without tears ⋮ Unnamed Item ⋮ Representations versus numberings: On the relationship of two computability notions ⋮ A domain-theoretic approach to computability on the real line ⋮ Computable Banach spaces via domain theory ⋮ Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II

This page was built for publication: Algorithmic operators in constructive metric spaces