PreprintarXiv licencearXiv
The computational capacity of the Logistic family
Abstract
Viewing computing machines as symbolic dynamical systems is a powerful idea which has led to many important results. However, the standard setting of symbolic Turing dynamics is not well suited for studying questions of typicality, genericity, or robustness. Such natural questions, for example, as "what is the computational power of a typical computer program?", "how common is poly-time computability", or "how common is universal computation among all algorithms?" require a different approach. In this paper we develop a suitable general framework of viewing families of dynamical systems as computing devices. We study a specific class of such devices given by the logistic family, and give the answers to the above questions in this setting.
Related
- Geographic Disparities in Hospice Quality and Family Caregiver Experience: The Roles of Ownership, Social Vulnerability, and Workforce Capacity
- A closed-form law for the Salikhov-Zeilberger-Zudilin-Bai family, and computational evidence that Bai's point is optimal
- A doubly nonlinear parabolic problem with variable exponents, homogeneous Neumann boundary conditions and generalized logistic source
- Data generation for the logistic regression model under controlled conditions
- A penalized logistic generalized regression estimator
BibTeX
@misc{rojas2026computational,
title = {{The computational capacity of the Logistic family}},
author = {Cristobal Rojas and Michael Yampolsky},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.03028},
eprint = {2611.03028},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.03028},
}
RIS
TY - UNPB
TI - The computational capacity of the Logistic family
AU - Cristobal Rojas
AU - Michael Yampolsky
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.03028
UR - https://arxiv.org/abs/2611.03028
AB - Viewing computing machines as symbolic dynamical systems is a powerful idea which has led to many important results. However, the standard setting of symbolic Turing dynamics is not well suited for studying questions of typicality, genericity, or robustness. Such natural questions, for example, as "what is the computational power of a typical computer program?", "how common is poly-time computability", or "how common is universal computation among all algorithms?" require a different approach. In this paper we develop a suitable general framework of viewing families of dynamical systems as computing devices. We study a specific class of such devices given by the logistic family, and give the answers to the above questions in this setting.
ER -