OACC
From MaRDI portal
Cited in
(11)- On measuring the complexity of networks: Kolmogorov complexity versus entropy
- A computable measure of algorithmic probability by finite approximations with an application to integer sequences
- An algorithmic look at financial volatility
- Analogical proportions: from equality to inequality
- Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
- Algorithmic information dynamics of cellular automata
- Model discovery and discrete inverse problems with cellular automata and Boolean networks
- Computable model discovery and high-level-programming approximations to algorithmic complexity
- acss
- On graph entropy measures based on the number of independent sets and matchings
- Correspondence and independence of numerical evaluations of algorithmic information measures
This page was built for software: OACC
