Enumerable Output Machines (EOMs, Schmidhuber, 2000)
Ouput may grow lexicographically
EOMs between MTMs and GTMs
Certain universality properties hold for EOMs but not for GTMs
Traditional studies (Solomonoff, Levin, Chaitin, Gács, Schnorr, Calude, Solovay, Li & Vitányi...): MTM with random inputs - enumerable measures
Here: EOM with random inputs - more powerful cumulatively enumerable measures
Back to J. Schmidhuber's Theory of Everything page