Conference Papers Year : 2016

The decidable properties of subrecursive functions

Abstract

What can be decided or semidecided about a primitive recursive function, given a definition of that function by primitive recursion? What about subrecursive classes other than primitive recursive functions? We provide a complete and explicit characterization of the decidable and semidecidable properties. This characterization uses a variant of Kolmogorov complexity where only programs in a subrecursive programming language are allowed. More precisely, we prove that all the decidable and semidecidable properties can be obtained as combinations of two classes of basic decidable properties: (i) the function takes some particular values on a finite set of inputs, and (ii) every finite part of the function can be compressed to some extent.
Fichier principal
Vignette du fichier
ricelike.pdf (433.38 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01308224 , version 1 (27-04-2016)

Licence

Identifiers

Cite

Mathieu Hoyrup. The decidable properties of subrecursive functions. International Colloquium on Automata, Languages, and Programming (ICALP) 2016, Jul 2016, Rome, Italy. ⟨10.4230/LIPIcs.ICALP.2016.108⟩. ⟨hal-01308224⟩
500 View
1084 Download

Altmetric

Share

More