On the linearity of on-line computable functions

Author： Pelibossian H.  

Publisher： Elsevier

ISSN： 0304-3975

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

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-line learning of smooth functions of a single variable

By Kimber D.   Long P.M.  

Theoretical Computer Science, Vol. 148, Iss. 1, 1995-08 ,pp. : 141-156

Elsevier

Access to resources Recommend Favorite

Framework for the optimization of online computable models

By Delinchant Benoit   Wurtz Frédéric   Vasconcelos João   Coulomb Jean-Louis  

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 33, Iss. 3, 2014-04 ,pp. : 745-758

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Improved bounds about on-line learning of smooth-functions of a single variable

By Long P.M.  

Theoretical Computer Science, Vol. 241, Iss. 1, 2000-06 ,pp. : 25-35

Elsevier

Access to resources Recommend Favorite

On Generalized Linearity of Quadratic Fractional Functions

By Cambini R.   Carosi L.  

Journal of Global Optimization, Vol. 30, Iss. 2-3, 2004-11 ,pp. : 235-251

Springer Publishing Company

Access to resources Recommend Favorite

Parameter free induction and provably total computable functions

By Beklemishev L.D.  

Theoretical Computer Science, Vol. 224, Iss. 1, 1999-08 ,pp. : 13-33

Elsevier

Access to resources Recommend Favorite