Program/Two registers/Bijective mapping/Exercise

We consider a computer with only two memory units, each can represent a natural number. At the start of every program (a sequence of commands), the initial entries are ${}(0,0)$. The computer can empty a memory unit, it can increase a memory unit by ${}1$, it can jump to another command (unconditional Goto) and it can compare the two entries of the two memory units. Moreover, it can jump to another command in case the comparing condition is fulfilled (conditional Goto). There is a printing command which prints the entries at the moment. Write a computer-program such that every pair ${}(n,m)\in \mathbb {N} ^{2}$

is printed exactly once.

Create a solution