On the Synthesis of Strategies Identifying Recursive Functions

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-44581-1_11
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On the Intrinsic Complexity of Learning Recursive Functions

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

The Class of Recursive Functions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1958English

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

The Complexity of Real Recursive Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Beyond Recursive Real Functions

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

Partial Recursive Functions and Finality

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Modular Strategies for Recursive Game Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Recursive Functions Defined by Ordinal Recursions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1969English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy