QX: Difference between revisions
Jump to navigation
Jump to search
Content deleted Content added
Created page with "'''QX''' is a Turing tarpit made by User:↑. == Commands == {| class="wikitable" |- ! Command !! What it does |- | Q [a] || Increments the current value at pointer by a. Can decrement if a is negative |- | X [a] [b] || If a <= previous item at pointer then go to previous item at pointer and jump to line b else go to next item at pointer. |} == Turing-completeness proof == * It can read and write to memory * It can perform arithmetic * It has a loop that can be u..." |
→Turing-completeness proof: As on Q!?(or Q?!) , the proof is just good good enough as a proof |
||
| Line 9: | Line 9: | ||
| X [a] [b] || If a <= previous item at pointer then go to previous item at pointer and jump to line b else go to next item at pointer. |
| X [a] [b] || If a <= previous item at pointer then go to previous item at pointer and jump to line b else go to next item at pointer. |
||
|} |
|} |
||
== Turing-completeness proof == |
|||
* It can read and write to memory |
|||
* It can perform arithmetic |
|||
* It has a loop that can be unbounded. |
|||
== Examples == |
== Examples == |
||
=== Infinite loop === |
=== Infinite loop === |
||
Revision as of 19:12, 4 December 2025
QX is a Turing tarpit made by User:↑.
Commands
| Command | What it does |
|---|---|
| Q [a] | Increments the current value at pointer by a. Can decrement if a is negative |
| X [a] [b] | If a <= previous item at pointer then go to previous item at pointer and jump to line b else go to next item at pointer. |
Examples
Infinite loop
X 1 1 X 1 1