| 1 |
Apresentação: Polonização cruzada: literatura, jornalismo, jornalismo literário
|
|
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Statistical Complexity Analysis of Turing Machine tapes with Fixed Algorithmic Complexity Using the Best-Order Markov Model
|
|
|
|
In: Entropy (Basel) (2020)
|
|
Abstract:
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 machines with the same algorithmic complexity can create tapes with different statistical complexity. In this paper, we use a compression-based approach to measure global and local statistical complexity of specific Turing machine tapes with the same number of states and alphabet. Both measures are estimated using the best-order Markov model. For the global measure, we use the Normalized Compression (NC), while, for the local measures, we define and use normal and dynamic complexity profiles to quantify and localize lower and higher regions of statistical complexity. We assessed the validity of our methodology on synthetic and real genomic data showing that it is tolerant to increasing rates of editions and block permutations. Regarding the analysis of the tapes, we localize patterns of higher statistical complexity in two regions, for a different number of machine states. We show that these patterns are generated by a decrease of the tape’s amplitude, given the setting of small rule cycles. Additionally, we performed a comparison with a measure that uses both algorithmic and statistical approaches (BDM) for analysis of the tapes. Naturally, BDM is efficient given the algorithmic nature of the tapes. However, for a higher number of states, BDM is progressively approximated by our methodology. Finally, we provide a simple algorithm to increase the statistical complexity of a Turing machine tape while retaining the same algorithmic complexity. We supply a publicly available implementation of the algorithm in C++ language under the GPLv3 license. All results can be reproduced in full with scripts provided at the repository.
|
|
Keyword:
Article
|
|
URL: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC7516407/
https://doi.org/10.3390/e22010105
|
|
BASE
|
|
Hide details
|
|
|
| 4 |
Representações sobre a aquisição da língua inglesa por estudantes brasileiros surdos: um estudo exploratório e fenomenológico
|
|
|
|
BASE
|
|
Show details
|
|
|
| 5 |
A redução do consumo de energia elétrica em Manaus através de medidas de eficiência energética em climatização industrial
|
|
SILVA, Jorge Lúcio da. - : Universidade Federal do Pará, 2017. : Brasil, 2017. : Instituto de Tecnologia, 2017. : UFPA, 2017. : Programa de Pós-Graduação em Engenharia Elétrica, 2017
|
|
BASE
|
|
Show details
|
|
|
| 6 |
A participação dos atores universitários : um estudo do caso do Salão de Iniciação Científica da UFRGS
|
|
|
|
BASE
|
|
Show details
|
|
|
| 12 |
O (PROTO)TEATRO POLÍTICO DE S ARAMAGO E A POLÍTICA COMO TEATRO - UMA LEITURA DE "TEATRO TODOS OS DIAS"
|
|
|
|
In: Revista Letras; v. 63 (2004) ; 2236-0999 ; 0100-0888 ; 10.5380/rel.v63i0 (2004)
|
|
BASE
|
|
Show details
|
|
|
| 15 |
Distribución y estructura interna de los clíticos del español : análisis de cuatro fenómenos desde la Morfología Distribuida
|
|
|
|
In: Lexis. - Lima : Dept. 24 (2000) 2, 259-281
|
|
BLLDB
|
|
Show details
|
|
|
|
|
