Disan Count

A Disan Count is a program designed to test whether a programming language can execute infinite loops, conditionals, I/O and basic arithmetic operations successfully. As any programming language able to implement this function can also be used to implement a Turing machine, a Disan Count can be used to test the Turing completeness of any given language.

History
Disan Counts where proposed by Matías Di Santo by late 2016, as a way to test basic Turing completeness of simple programming languages. As Di Santo explained, any programming language able to implement an arbitrarily long jump cycle effectively could also be used to mimic the movement of an infinite Turing Automata tape. By also introducing means of testing (in)equality and value storage, the read from and write to the tape operations could also be simulated, thus rendering the given language Turing complete.

Algorithm
The algorithm is defined as:

n ← input n a ← 0 Start: If a is even: print "a is even!" a ← a + 1 If a < n:    Jump to Start

For example, in C++ said program could be written as:

int n; n << cin; int a = 0; while(a < n){ if(a % 2 == 0) cout << a << " is even!"; a++; }

Note that in order to test Turing Completeness using a Disan Count, one must not 'cheat' the algorithm by increasing the iteration variable by any number other than one, using finite-state loops (like for loops) or avoiding conditionals.