Disan Count (language)

Disan Count is an esoteric programming language created by User:TheCanon2 to demonstrate the insufficiency of using the Disan Count as a proof for Turing-completeness.

Commands

Disan Count (language) has a single accumulator, x and 2 commands.

Command	Action
i	Set x to an input
D	Print the Disan Count for x

Examples

Disan Count

iD

Computational class

The Disan Count fails as a proof of Turing-completeness because it is susceptible to the HQ9+ problem, in which a language can perform popular problems that imply Turing-completeness despite being computationally limited to said problems.

Disan Count (language) is not Turing-complete because all programs halt.

Implementations

The following Python script is an interpreter.

prgm = input('>Disan Count ')
x = 0
for i in range(0, len(prgm)):
    if prgm[i] == "i":
        x = int(input('>i '))
    if prgm[i] == "D":
        for j in range(0, x, 2):
            print("%d is even!" % j)