ZEDED - Nondeterministic Zero Instruction Set Computer

— Who's Zed?

— Zed's dead baby, Zed's dead...

ZEDED is an esoteric (read: pointless) nondeterministic zero-instruction VM that interprets at least two raw binary files concurrently. The idea was influenced by nondeterminism, concurrency, ZISCs, the quantum wave function collapse, and Pulp Fiction. ZEDED has no syntax as the language (and machine) has no instructions or opcodes. Essentially, any binary (or hex, for ease of readability) string is valid ZEDED. For example, 01 47 6f 6f 64 62 79 65 2c 20 77 6f 72 6c 64 21 aa could print "Goodbye, world!" to stdout depending on various factors as well as luck.

What makes ZEDED strange is the fact that at least two binary (source) files are needed for execution of any program. In a more general sense, every program is made up of two to N programs known as pathways. Every pathway is traversed by its own code pointer. All pathways are also given a FIFO stack and an accumulator. Pathways are executed concurrently.

Note: ZEDED (due to some unimplemented details) is currently not Turing-complete.