Skip to main content


Showing posts from September, 2021

Cellular Automata, Computational irreducibility and Equational models, towards AGI

The general assumption that we can find an equation for every data sequence is proven false when we observe the evolution of Rule 30 Cellular automaton. Computational irreducibility proves that we cannot always capture a summary of data with an equation, but sometimes the most concise representation of data is the program that generated the data itself. 

Towards program based models

 As the deeplearning fever has calmed down like I actually predicted it will because we have not seen any general AI arise from it, its time to reflect on what we have learned from it and gain wisdom in order to avoid folly in the future and to also help correct our trajectory towards AGI so we can reach there in a reasonable time.