Hector Zenil

32 Abonné

I consider myself a 'computational natural scientist' (Greg Chaitin described me as a "new kind of practical theoretician"). My interests lie at the intersection of two major areas of science, namely Computability and Causality leading to what I call Algorithmic Information Dynamics. I co-lead the Algorithmic Dynamics Lab, and I am the head of the Algorithmic Nature Group, the Paris-based lab behind the Online Algorithmic Complexity Calculator and the Human Randomness Perception and Generation Project, operating from the UK. Previously, I was a Research Associate at the Behavioural and Evolutionary Theory Lab at the University of Sheffield before joining the University of Oxford

algorithmic randomness information theory complex systems kolmogorov complexity cellular automata algorithmic probability computational biology network biology algorithmic nature algorithmic complexity program-size complexity programmability complexity turing machines time complexity complexity science fractal complexity levin distribution hector zenil chaitin-levin coding theorem game of life elementary cellular automata dynamical systems dynamic systems algorithmic dynamics multidimensional complexity shannon entropy graph complexity searle chinese room turing test cognition consciousness small computer programs np!=p fractal dimension computational complexity programmable medicine synthetic biology computable universe reprogramming nature artificial life artificial intelligence what is computation tradeoffs space-time diagrams hausdorff complexity complex networks compressibility topology graph automorphisms graph theory similarity metrics compression distance bioinformatics computational medicine computability finite randomnes chaitin omega martin-loef randomness levin semi-measure turing machine chaitin jean-paul delahaye universal distribution

Tout plus

Présentations
Documents
Infographies

Plus récents Les plus populaires

Hector Zenil

Unit 2: All

Unit 5: All

Unit 6: All

4.11: The Infinite Programming Monkey

4.12: The Algorithmic Coding Theorem

4.13: Bennett's Logical Depth: A Measure of Sophistication

4.10: Algorithmic Probability & the Universal Distribution

4.9: The Chaitin-Leibniz Medal

4.8: Epistemological Aspects of Infinite Wisdom

4.7: Chaitin's Omega Number

4.6: Convergence of Definitions

4.5: The Invariance Theorem

4.4: Algorithmic Complexity and Compressibility

4.3: Pseudo Randomness

4.1 Sources of Randomness

Unit 3: Classical information

Unit 3: Shannon entropy and meaning

Unit 3: Joint, Conditional, Mutual Information, & a Case Study

Unit 3: Entropy rate, languages and multidimensional data

Unit 3: Redundancy, noise, and biological information