X-complete

This is still a work in progress. It may be changed in the future.

X-Complete is a set of rules defined by User:FluixMakesEsolangs.

To be X-Complete, an implementation must be able to perform logic or arithmetic between an arbitrary number of values, such as

(X XOR Z) AND Y

or

((7 + 9) * 4)/3

Relationship to computation

X-Complete systems are most likely "Usable for computation", and can compute functions needed for Turing-Completeness, as any Turing-Complete system is also X-Complete.

Relationship to the physical world

X-Complete systems can be built, unlike Turing machines, which have unbounded storage, an impossibility in the physical world.

X-Complete systems

Any Turing-complete system. Any LBA, PDA, BSM. Esoteric Languages: SMETANTA (Likely?) Brainfuck Non-Esoteric Languages: C/C++ Python