Partial Recursive Functions and Finality

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-38164-5_21
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Probabilistic Recursive Functions

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1973English

Beyond Recursive Real Functions

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

The Class of Recursive Functions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1958English

The Complexity of Real Recursive Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

A Theorem on General Recursive Functions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1960English

Recursive Functions Defined by Ordinal Recursions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1969English

On the Intrinsic Complexity of Learning Recursive Functions

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

Concerning Partial Recursive Similarity Transformations of Linearly Ordered Sets

Pacific Journal of Mathematics
Mathematics
1977English

Continuously Extending Partial Functions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy