On Randomized Computational Models and Complexity Classes: a Historical Overview
<|reference_start|>On Randomized Computational Models and Complexity Classes: a Historical Overview: Since their appearance in the 1950s, computational models capable of performing probabilistic choices have received wide attention and are nowadays pervasive in almost every areas of computer science. Their development was also inextricably linked with inquiries about computation power and resource issues. Although most crucial notions in the field are well-known, the related terminology is sometimes imprecise or misleading. The present work aims to clarify the core features and main differences between machines and classes developed in relation to randomized computation. To do so, we compare the modern definitions with original ones, recalling the context in which they first appeared, and investigate the relations linking probabilistic and counting models.<|reference_end|>
@article{antonelli2024on,
    title={On Randomized Computational Models and Complexity Classes: a Historical
  Overview},
    author={Melissa Antonelli, Ugo Dal Lago, Paolo Pistone},
    journal={arXiv preprint arXiv:2409.11999},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.11999},
    primaryClass={cs.LO}
}