Probabilistic Recursion Theory and Implicit Computational Complexity (Long Version)
Logic in Computer Science
2014-06-26 v2
Abstract
We show that probabilistic computable functions, i.e., those functions outputting distributions and computed by probabilistic Turing machines, can be characterized by a natural generalization of Church and Kleene's partial recursive functions. The obtained algebra, following Leivant, can be restricted so as to capture the notion of polytime sampleable distributions, a key concept in average-case complexity and cryptography.
Cite
@article{arxiv.1406.3378,
title = {Probabilistic Recursion Theory and Implicit Computational Complexity (Long Version)},
author = {Ugo Dal Lago and Sara Zuppiroli},
journal= {arXiv preprint arXiv:1406.3378},
year = {2014}
}