Complexity classes of provable recursive functions

Research output: Contribution to journalArticlepeer-review


Complexity measures and provable recursive functions (p-functions) are combined to define a p-measure as a measure for which Blum's axioms can be proved in a given axiomatic system. For p-measures, it is shown that the complexity class of a p-function contains only p-functions and that all p-functions form a single complexity class. Various other classes and a variation of a complexity measure, all suggested by the notion of provability, are also investigated. Classical results in complexity theory remain true when relativized to p-functions.

Original languageEnglish
Pages (from-to)294-303
Number of pages10
JournalJournal of Computer and System Sciences
Issue number3
StatePublished - Jun 1979
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Complexity classes of provable recursive functions'. Together they form a unique fingerprint.

Cite this