Algorithmic Complexity
Mostrando 1-7 de 7 artigos, teses e dissertações.
-
1. COUNTERFACTUAL ANALYSIS BY ALGORITHMIC COMPLEXITY: A METRIC BETWEEN POSSIBLE WORLDS
Abstract Counterfactuals have become an important area of interdisciplinary interest, especially in logic, philosophy of language, epistemology, metaphysics, psychology, decision theory, and even artificial intelligence. In this study, we propose a new form of analysis for counterfactuals: analysis by algorithmic complexity. Inspired by Lewis-Stalnaker's Pos
Manuscrito. Publicado em: 2022
-
2. Teoria da informação algorítmica, eficiência relativa de mercado e perda de memória em séries de retornos de alta frequência em ativos negociados na BM&F BOVESPA. / Algorithmic information theory, relative market efficiency and memory loss in high frequency asset return series traded at BM &F BOVESPA.
O presente trabalho tem por objetivos: 1) aplicar a teoria da complexidade de Kolmogorov utilizando a medida proposta por Lempel e Ziv (1976) para analisar o comportamento desta diante de alterações em parâmetros como tamanho de janela, salto e de região de estabilidade em séries financeiras de retornos de alta freqüência de ativos negociados na BM&F
Publicado em: 2010
-
3. Análise,Simulações e Aplicações Algorítmicas de Caminhadas Quânticas / Analysis,Simulations and Algorithmic Applications of Quantum Walks
Quantum computing is a model of computation based on the laws of quantum mechanics, which can be used to develop faster algorithms. The development of efficient quantum algorithms, however, is a highly challenging task. A recent successful approach is the use of quantum walks. In this work, we have studied the quantum walk on the hypercube, obtaining the exa
Publicado em: 2010
-
4. Computational aspects of the Helly property: a survey
In 1923, Eduard Helly published his celebrated theorem, which originated the well known Helly property. Say that a family of subsets has the Helly property when every subfamily of it, formed by pairwise intersecting subsets, contains a common element. There are many generalizations of this property which are relevant to some parts of mathematics and several
Journal of the Brazilian Computer Society. Publicado em: 2006-06
-
5. Codigos de linha para sistemas opticos de alta capacidade
Alternative coding techniques for high speed optical transmission systems, in wich the use of extensive tables in memory is a problem, have been discussed in recent literature. Two solutions for this problem are discussed in this work. The first is a modified version of the PFmB(m+ 1)B codes, with higher performance and no added complexity. The second coding
Publicado em: 1994
-
6. Sporadicity: Between periodic and chaotic dynamical behaviors
We define the class of sporadic dynamical systems as the systems where the algorithmic complexity of Kolmogorov [Kolmogorov, A. N. (1983) Russ. Math. Surv. 38, 29-40] and Chaitin [Chaitin, G. J. (1987) Algorithmic Information Theory (Cambridge Univ. Press, Cambridge, U.K.)] as well as the logarithm of separation of initially nearby trajectories grow as nv0(l
-
7. A recipe for randomness
Despite many diverse theories that address closely related themes—e.g., probability theory, algorithmic complexity, cryptoanalysis, and pseudorandom number generation—a near-void remains in constructive methods certified to yield the desired “random” output. Herein, we provide explicit techniques to produce broad sets of both highly irregular fi
The National Academy of Sciences.