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

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...

Full description

Bibliographic Details
Main Authors: Jorge M. Silva, Eduardo Pinho, Sérgio Matos, Diogo Pratas
Format: Article
Language:English
Published: MDPI AG 2020-01-01
Series:Entropy
Subjects:
turing machines
information theory
statistical complexity
algorithmic complexity
computational complexity
markov models
compression-based analysis
Online Access:https://www.mdpi.com/1099-4300/22/1/105

Internet

https://www.mdpi.com/1099-4300/22/1/105

Similar Items