Representations versus numberings: on the relationship of two computability notions

Author： Spreen D.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.262, Iss.1, 2001-07, pp. : 473-499

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

Cook versus Karp-Levin: Separating completeness notions if NP is not small

By Lutz J.H.   Mayordomo E.  

Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. : 141-163

Elsevier

Access to resources Recommend Favorite

Kolmogorov numberings and minimal identification

By Freivalds R.   Jain S.  

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 175-194

Elsevier

Access to resources Recommend Favorite

Explicit versus implicit representations of subsets of the Herbrand universe

By Pichler R.  

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 1021-1056

Elsevier

Access to resources Recommend Favorite

Transactional marketing versus relationship marketing: the US automobile market evolution

By Cornette Guy   Pontier Suzanne  

International Journal of Automotive Technology and Management, Vol. 2, Iss. 2, 2003-07 ,pp. : 177-189

Inderscience Publishers

Access to resources Recommend Favorite

On the computability of Walsh functions

By Mori T.  

Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. : 419-436

Elsevier

Access to resources Recommend Favorite