Statistical Complexity Analysis of Turing Machine tapes with Fixed Algorithmic Complexity Using the Best-Order Markov Model

Sources that generate symbolic sequences with algorithmic nature may differ in statistical complexity because they create structures that follow algorithmic schemes, rather than generating symbols from a probabilistic function assuming independence. In the case of Turing machines, this means that ma...

Descripción completa

Detalles Bibliográficos
Autores principales: Silva, Jorge M., Pinho, Eduardo, Matos, Sérgio, Pratas, Diogo
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7516407/
https://www.ncbi.nlm.nih.gov/pubmed/33285880
http://dx.doi.org/10.3390/e22010105

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7516407/
https://www.ncbi.nlm.nih.gov/pubmed/33285880
http://dx.doi.org/10.3390/e22010105

Ejemplares similares