On Effectively Computable Operators

DOI10.1002/MALQ.19710170127zbMath0245.02036OpenAlexW2021538402MaRDI QIDQ5656752

John P. Helm

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)

Related Items (8)

On the power of recursive optimizers ⋮ Learning recursive functions: A survey ⋮ Consistent and coherent learning with \(\delta \)-delay ⋮ On effective topological spaces ⋮ Representations versus numberings: On the relationship of two computability notions ⋮ Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems ⋮ Learning classes of approximations to non-recursive functions. ⋮ On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings

This page was built for publication: On Effectively Computable Operators