Type your sequence of integers into the program and it will predict the following terms in real-time using the concept of Solomonoff induction. Solomonoff induction generates hypotheses as programs, runs them, and compares the output with the target data. However, Solomonoff induction is uncomputable, so I have created a heuristic version. Sliders change the program's behaviors: - EXEC_LIMIT: The number of times a program can execute. - PROG_LEN_LIMIT: Limit of the program's length. - MEMORY_LEN: Limit of memory slots. - ADD_LEN_REQUIRED: Minimum requirement of the number of additional terms. Remember to press 'r' every time you change the sliders to reset the prediction process. In case you're wondering, the language for the programs is a variation of BrainFart.
Right now this program can only guess simple sequences fast enough. Complex ones can take a long while. Example sequences for testing: - Can guess immediately: 0,0,0,0; 1,1,1,1; 1,2,3,4,5,6; -1,-2,-3,-4 - Can take a while: 2,4,6,8,10; 3,6,9,12,15; 1,0,1,0,1,0 - Can take a longer while: 5,10,15,20; 1,0,2,0,3,0; -2,-1,0,1,2,3; 10,20,30,40; 1,0,2,1,3,2,4,3 - Can take an eternity: 100,200,300,400; 1,4,9,16; 1,2,4,8,16,32 FPS determines the prediction speed. Try to decrease the sliders to increase the FPS. For complex sequences, use https://turbowarp.org/915720060 For even more complex sequences, check out this C++ version: https://github.com/khang200923/sih Credit to: - Ray Solomonoff for the invention - LessWrong for inspiration - Scratch for programming language #solomonoff #induction #heuristic #math April 22nd, 2025: modified... now it's a little bit broken September 3rd, 2025: now it's not
