Programs It Never Saw · Universal Machine Transformer

Programs it never saw

The network was trained only while a universal Turing machine ran random little machines with up to five states, on tapes of up to six cells. Here it runs real programs, written for this page: the Collatz problem, a binary counter, a sort, addition, counting, the Fibonacci numbers. Every step of every run is checked against the program run directly.

Program

Input

Universal machine Speed

Collatz

–

The machine's tape, now

Forward passes0

Steps of this program0

Universal-machine steps0

Configurations matching the direct run0

Different steps it needed0

Never seen in training0

Disagreed with the exact rule0

The program

It is written on the universal machine's tape as data:

Its rules ( states)

No program is in the training data, only the universal machine's own steps, 14,849 of them in all. A new program runs correctly when every step it needs is one the network learned to take; the counter above of steps "never seen in training" would show it if one were not.