Recursive characterization of computable real-valued functions and relations

Author： Brattka V.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.162, Iss.1, 1996-08, pp. : 45-77

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the inductive inference of recursive real-valued functions

By Apsitis K.   Arikawa S.   Freivalds R.   Hirowatari E.   Smith C.H.  

Theoretical Computer Science, Vol. 219, Iss. 1, 1999-05 ,pp. : 3-17

Elsevier

Access to resources Recommend Favorite

A comparison of identification criteria for inductive inference of recursive real-valued functions

By Hirowatari E.   Arikawa S.  

Theoretical Computer Science, Vol. 268, Iss. 2, 2001-10 ,pp. : 351-366

Elsevier

Access to resources Recommend Favorite

Fat-Shattering and the Learnability of Real-Valued Functions

By Bartlett P.L.   Long P.M.   Williamson R.C.  

Journal of Computer and System Sciences, Vol. 52, Iss. 3, 1996-06 ,pp. : 434-452

Academic Press

Access to resources Recommend Favorite

Relatively recursive reals and real functions

By Ho C.-K.  

Theoretical Computer Science, Vol. 210, Iss. 1, 1999-01 ,pp. : 99-120

Elsevier

Access to resources Recommend Favorite

Effectively closed sets and graphs of computable real functions

By Cenzer D.   Remmel J.B.  

Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. : 279-318

Elsevier

Access to resources Recommend Favorite