On Effectively Computable Operators
From MaRDI portal
Publication:5656752
DOI10.1002/malq.19710170127zbMath0245.02036MaRDI QIDQ5656752
Publication date: 1971
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19710170127
68Q25: Analysis of algorithms and problem complexity
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
03D65: Higher-type and set recursion theory
Related Items
On effective topological spaces, Representations versus numberings: On the relationship of two computability notions, Learning recursive functions: A survey, Consistent and coherent learning with \(\delta \)-delay, On the power of recursive optimizers, Learning classes of approximations to non-recursive functions., On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings, Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems