English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

The 'almost all' theory of subrecursive degrees is decidable

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Loeckx,  Jacques
Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Mehlhorn, K. (1974). The 'almost all' theory of subrecursive degrees is decidable. In Automata, languages and programming: 2nd colloquium (ICALP-74) (pp. 317-325). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AFE0-8
Abstract
There is no abstract available