Suchergebnisse - Computational Complexity and Algorithmic Information Theory

Computational Creativity and Aesthetics with Algorithmic Information Theory von Mondol, Tiasa, Brown, Daniel G.

“… We build an analysis based on the Algorithmic Information Theory of computational creativity and extend it to revisit computational aesthetics, thereby, improving on the existing efforts of its formulation …”
Volltext

Why Computational Complexity Requires Stricter Martingales von Hitchcock, John M., Lutz, Jack H.

“… In computational complexity and algorithmic information theory, a martingale is typically a function d on strings such that E(d(wb)| w) = d(w …”
Volltext

Quantum algorithmic measurement von Aharonov, Dorit, Cotler, Jordan, Qi, Xiao-Liang

“… However, a systematic treatment and comprehensive framework are missing. Here we initiate the systematic study of experimental quantum physics from the perspective of computational complexity …”
Volltext

Symmetry and simplicity spontaneously emerge from the algorithmic nature of evolution von Johnston, Iain G, Dingle, Kamaludin, Greenbury, Sam F, Camargo, Chico Q, Doye, Jonathan P K, Ahnert, Sebastian E, Louis, Ard A

“… ? Just as monkeys randomly typing into a computer language will preferentially produce outputs that can be generated by shorter algorithms, so the coding theorem from algorithmic information theory …”
Weitere Angaben

Uncomputability and undecidability in economic theory von Vela Velupillai, K.

“… ] are frontier research subjects. All of them, each in its own way, are underpinned by (classical) recursion theory – and its applied branches, say computational complexity theory or algorithmic information theory …”
Volltext

Algorithmic No-Cloning Theorem von Epstein, Samuel

“… We introduce notions of algorithmic mutual information and deficiency of randomness of quantum states …”
Volltext

Information Complexity Ranking: A New Method of Ranking Images by Algorithmic Complexity von Chambon, Thomas, Guillaume, Jean-Loup, Lallement, Jeanne

“… Predicting how an individual will perceive the visual complexity of a piece of information is still a relatively unexplored domain, although it can be useful in many contexts such as for the design of human–computer interfaces …”
Volltext

Effective Strong Dimension in Algorithmic Information and Computational Complexity von Athreya, Krishna B., Hitchcock, John M., Lutz, Jack H., Mayordomo, Elvira

“… [Proceedings of the 15th IEEE Conference on Computational Complexity, Florence, Italy, 2000, IEEE Computer Society Press, Piscataway, NJ, 2000, pp. 158-169 …”
Volltext

Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach von Getachew, Eyob Solomon, Assefa, Beakal Gizachew

“… This research focuses on designing an efficient algorithm to compute the stopping time of numbers in the Collatz sequence, achieving significant computational improvements …”
Volltext

LSD-induced increase of Ising temperature and algorithmic complexity of brain dynamics von Ruffini, Giulio, Damiani, Giada, Lozano-Soldevilla, Diego, Deco, Nikolas, Rosas, Fernando E., Kiani, Narsis A., Ponce-Alvarez, Adrián, Kringelbach, Morten L., Carhart-Harris, Robin, Deco, Gustavo

“… (system temperature, critical point, susceptibility) and from algorithmic complexity. We hypothesized, along the lines …”
Volltext

Effective fractal dimensions von Lutz, Jack H.

“… This paper surveys these developments and their applications in algorithmic information theory and computational complexity theory. (© 2004 WILEY‐VCH Verlag GmbH & Co …”
Volltext

Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness von Delahaye, Jean-Paul, Zenil, Hector

“… An output frequency distribution is then computed, from which the algorithmic probability is calculated and the algorithmic complexity evaluated by way of the Levin …”
Volltext

Algorithmic and Complexity Aspects of Path Computation in Multi-Layer Networks von Lamali, Mohamed Lamine, Fergani, Nasreddine, Cohen, Johanne

“… Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage …”
Volltext

Approximations of algorithmic and structural complexity validate cognitive-behavioral experimental results von Zenil, Hector, Marshall, James A. R., Tegnér, Jesper

“… By numerically approximating algorithmic (Kolmogorov) complexity ( K ), we establish an objective tool to characterize behavioral complexity …”
Volltext

Algorithmic solutions for maximizing shareable costs von Zou, Rong, Lin, Boyue, Uetz, Marc, Walter, Matthias

“… The article first gives a fairly complete picture of the computational complexity of this optimization problem, its relation to optimization over the core itself, and its equivalence …”
Volltext

A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity von Zenil, Hector, Hernández-Orozco, Santiago, Kiani, Narsis A., Soler-Toscano, Fernando, Rueda-Toicen, Antonio, Tegnér, Jesper

“… ) that approximates local estimations of algorithmic complexity based on Solomonoff–Levin’s theory of algorithmic probability providing a closer connection to algorithmic …”
Volltext

Descriptional and computational complexity of finite automata—A survey von Holzer, Markus, Kutrib, Martin

“… Finite automata are probably best known for being equivalent to right-linear context-free grammars and, thus, for capturing the lowest level of the …”
Volltext

Statistical Complexity Analysis of Turing Machine tapes with Fixed Algorithmic Complexity Using the Best-Order Markov Model von Silva, Jorge M., Pinho, Eduardo, Matos, Sérgio, Pratas, Diogo

“… 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 …”
Volltext

Disentangling the Computational Complexity of Network Untangling von Froese, Vincent, Kunz, Pascal, Zschoche, Philipp

“… Both variants of the problem are NP-hard. In this paper, we initiate a multivariate complexity analysis involving the following parameters …”
Volltext

Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications von Kaplan, Haim, Mulzer, Wolfgang, Roditty, Liam, Seiferth, Paul, Sharir, Micha

“… (convex, pairwise disjoint) sites that have constant description complexity (e.g., points, line segments, disks, etc …”
Volltext