On the Intrinsic Complexity of Learning Recursive Functions

Information and Computation - United States
doi 10.1016/s0890-5401(03)00059-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

The Complexity of Real Recursive Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Intrinsic Complexity of Uniform Learning

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

The Class of Recursive Functions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1958English

On the Synthesis of Strategies Identifying Recursive Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Minimizing the Average Query Complexity of Learning Monotone Boolean Functions

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2002English

A Theorem on General Recursive Functions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1960English

Probabilistic Recursive Functions

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1973English

On the Cryptographic Complexity of the Worst Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Beyond Recursive Real Functions

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1996English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy