OACC

swMATH10996MaRDI QIDQ22948FDOQ22948

Author name not available (Why is that?)

Cited In (10)

• Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
• Computable model discovery and high-level-programming approximations to algorithmic complexity
• Analogical proportions: from equality to inequality
• Algorithmic information dynamics of cellular automata
• 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
• On graph entropy measures based on the number of independent sets and matchings
• Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
• Model discovery and discrete inverse problems with cellular automata and Boolean networks
• An algorithmic look at financial volatility

This page was built for software: OACC