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 functionally complete logic or arithmetic between an arbitrary number of values, such as

(X XOR Z) AND Y

or

((7 + 9) * 4)/3

To be X-Complete a system must also be able to store the result, smybols in such result are arbitrary.

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. If a system is X-Complete, it can solve any equation that can fit into memory, but not every algorithm, unless it's Turing-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. It is also quite easy to make an X-Complete system, as the requirements are low.

X-Complete systems

Esoteric Languages: SMETANA, Smallfuck, Brainfuck, and a lot more... Non-Esoteric Languages: C/C++, Python, and a lot more...