On the complexity of learning programs

DOI10.1007/978-3-031-36978-0_14arXiv2302.04213OpenAlexW4384788384MaRDI QIDQ6149041

Vasco Brattka

Publication date: 12 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.04213

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Closed choice and a uniform low basis theorem
• Learning recursive functions: A survey
• Classical recursion theory. Vol. II
• A topological view on algebraic computation models
• On the information carried by programs about the objects they compute
• Effective Choice and Boundedness Principles in Computable Analysis
• Slicing the Truth
• On the algebraic structure of Weihrauch degrees
• ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM
• A note on the diamond operator
• Weihrauch Complexity in Computable Analysis
• Reverse Mathematics
• Language identification in the limit
• Algebraic properties of the first-order part of a problem
• Alien coding
• THE DISCONTINUITY PROBLEM

This page was built for publication: On the complexity of learning programs