Results 11 to 20 of about 55,876 (328)
Algorithmic Randomness and Capacity of Closed Sets [PDF]
We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed sets K which have
Douglas Cenzer +3 more
doaj +3 more sources
We consider algorithmic randomness in the Cantor space C of the infinite binary sequences. By an algorithmic randomness concept one specifies a set of elements of C, each of which is assigned the property of being random.
Mihailovic, Nenad
core +4 more sources
The principle of maximum entropy (Maxent) is often used to obtain prior probability distributions as a method to obtain a Gibbs measure under some restriction giving the probability that a system will be in a certain state compared to the rest of the ...
Hector Zenil +2 more
doaj +3 more sources
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity [PDF]
We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic complexity based on Solomonoff–Levin’s theory of algorithmic ...
Hector Zenil +5 more
doaj +3 more sources
Adjusted Kolmogorov Complexity of Binary Words with Empirical Entropy Normalization [PDF]
Kolmogorov complexity of a finite binary word reflects both algorithmic structure and the empirical distribution of symbols appearing in the word. Words with symbol frequencies far from one half belong to smaller combinatorial classes and therefore ...
Brani Vidakovic
doaj +2 more sources
Freedom under algorithms: how unpredictable and asocial management erodes free choice [PDF]
This article examines the impact of algorithmic management on individual freedom. To orient this exploration, I draw on the (feminist) conception of liberty as the choosing subject.
Robert Donoghue
doaj +2 more sources
Algorithmic Complexity for Short Binary Strings Applied to Psychology: A Primer
Since human randomness production has been studied and widely used to assess executive functions (especially inhibition), many measures have been suggested to assess the degree to which a sequence is random-like.
A Aksentijevic +43 more
core +3 more sources
This expository paper advocates an approach to physics in which “typicality” is identified with a suitable form of algorithmic randomness. To this end various theorems from mathematics and physics are reviewed.
Klaas Landsman
doaj +1 more source
Algorithmic randomness for Doob's martingale convergence theorem in continuous time [PDF]
We study Doob's martingale convergence theorem for computable continuous time martingales on Brownian motion, in the context of algorithmic randomness. A characterization of the class of sample points for which the theorem holds is given. Such points are
Bjørn Kjos-Hanssen +2 more
doaj +1 more source
Computational Creativity and Aesthetics with Algorithmic Information Theory
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.
Tiasa Mondol, Daniel G. Brown
doaj +1 more source

