The Computational Power of ℳω

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200201)48:1<117::AID-MALQ117>3.0.CO;2-J" /><117::AID-MALQ117>3.0.CO;2-J 10.1002/1521-3870(200201)48:1<117::AID-MALQ117>3.0.CO;2-JzbMath0993.03056OpenAlexW2075559370MaRDI QIDQ2776817

Christian Rørdam, Dag Normann

Publication date: 16 September 2002

Full work available at URL: https://doi.org/10.1002/1521-3870(200201)48:1<117::aid-malq117>3.0.co;2-j

zbMATH Keywords

domainsfan functionalcontinuous functionalshigher types\(\mu\)-recursiontotal functionals

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Cites Work

• Unnamed Item
• Computations in higher types

This page was built for publication: The Computational Power of ℳω