Communication Dans Un Congrès Année : 2024

Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories

Résumé

We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory à la Buss (expressed in this new language) precisely capture polytime random functions. Then, we provide two new characterizations of the semantic class BPP obtained by internalizing the error-bound check within a logical system: the first relies on measure-sensitive quantifiers, while the second is based on standard first-order quantification. This leads us to introduce a family of effectively enumerable subclasses of BPP, called BPP T and consisting of languages captured by those probabilistic Turing machines whose underlying error can be proved bounded in T. As a paradigmatic example of this approach, we establish that polynomial identity testing is in BPP T , where T = I∆0 + Exp is a well-studied theory based on bounded induction.
Fichier principal
Vignette du fichier
LIPIcs.CSL.2024.10.pdf (912) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04777376 , version 1 (10-12-2024)

Licence

Identifiants

Citer

Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone. Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories. CSL 2024 - 32nd EACSL Annual Conference on Computer Science Logic, Feb 2024, Napoli, Italy. ⟨10.4230/LIPIcs.CSL.2024.10⟩. ⟨hal-04777376⟩
25 Consultations
12 Téléchargements

Altmetric

Partager

More