Results 31 to 40 of about 1,725,284 (283)
Algorithmic Complexity in Cosmology and Quantum Gravity
Entropy, 2002 : In this article we use the idea of algorithmic complexity (AC) to study various cosmological scenarios, and as a means of quantizing the ravitational interaction.
D. Singleton, V. Dzhunushaliev
doaj +1 more source
Mathematics, 2020 In this paper we present an algorithm which counts the number of fixed point orbits of an AND-OR dynamical system. We further extend the algorithm in order to list all its fixed point orbits (FPOs) in polynomial time on the number of FPOs of the system.
Mauro Mezzini, Fernando L. Pelayo
doaj +1 more source
Frontiers in Computational Neuroscience, 2023 Being able to objectively characterize the intrinsic complexity of behavioral patterns resulting from human or animal decisions is fundamental for deconvolving cognition and designing autonomous artificial intelligence systems.
Hector Zenil +4 more
doaj +1 more source
Scholarpedia, 2008 The information content or complexity of an object can be measured by the length of its shortest description. For instance the string "01010101010101010101010101010101" has the short description "16 repetitions of 01", while "11001000011000011101111011101100" presumably has no simpler description other than writing down the string itself. More formally,
openaire +3 more sources
Algorithmic complexity of protein identification: combinatorics of weighted strings [PDF]
, 2004 Cieliebak M, Erlebach T, Lipták Z, Stoye J, Welzl E. Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Applied Mathematics.
Lipták, Zsuzsanna +9 more
core +1 more source
Quantum Dynamical Entropies and Gács Algorithmic Entropy
Entropy, 2012 Several quantum dynamical entropies have been proposed that extend the classical Kolmogorov–Sinai (dynamical) entropy. The same scenario appears in relation to the extension of algorithmic complexity theory to the quantum realm.
Fabio Benatti
doaj +1 more source
Frontiers in Applied Mathematics and Statistics, 2020 Based on the same databases, we computationally address two seemingly highly related, in fact drastically distinct, questions via computational data-driven algorithms: 1) how to precisely achieve the big task of differentiating gait signatures of many ...
Fushing Hsieh, Xiaodong Wang
doaj +1 more source
On the complexity of the BKW algorithm on LWE [PDF]
Designs, Codes and Cryptography, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Albrecht, Martin +4 more
openaire +10 more sources
Sorting by Multi-Cut Rearrangements
Algorithms, 2021 A multi-cut rearrangement of a string S is a string S′ obtained from S by an operation called k-cut rearrangement, that consists of (1) cutting S at a given number k of places in S, making S the concatenated string X1·X2·X3·…·Xk·Xk+1, where X1 and Xk+1 ...
Laurent Bulteau +3 more
doaj +1 more source