Turing Complete - Recent changes [en]

User:Qaplwsok

Qaplwsok — Fri, 10 Apr 2026 09:45:18 GMT

User account Qaplwsok was created

202.120.235.200 — Wed, 08 Apr 2026 11:15:46 GMT

← Older revision		Revision as of 11:15, 8 April 2026
(One intermediate revision by the same user not shown)
Line 335:		Line 335:
	\|152		\|152
	\|c_user		\|c_user
	\|		\|Identical/Similar to stable 32/8.
	\|-		\|-
	\|Equality		\|Equality
Line 343:		Line 343:
	\|155		\|155
	\|Micha_i		\|Micha_i
			\|
			\|-
			\|Unsigned Less
			Signed Less
			\|90
			\|4
			\| -
			\|360
			\|FermiEnergy & mqyxx
	\|		\|
	\|-		\|-
Line 520:		Line 529:
	\|33		\|33
	\|4		\|4
	\| -		\| 0
	\|132		\|132
	\|		\|
	\|		\|Identical to stable 27/8/1.
	\|-		\|-
	\|Storage Cracker		\|Storage Cracker
Line 539:		Line 548:
	\|0		\|0
	\|		\|
	\|		\|Identical to stable 0/0/1.
	\|-		\|-
	\|The Maze		\|The Maze
Line 547:		Line 556:
	\|11160		\|11160
	\|		\|
	\|		\|Identical to stable 2/2/739.
	\|-		\|-
	\|		\|
Line 644:		Line 653:
	\|8		\|8
	\|		\|
	\|		\|Identical to stable 2/4/3.
	\|-		\|-
	\|Tower of Alloy		\|Tower of Alloy
Line 668:		Line 677:
	\|2520		\|2520
	\|		\|
	\|		\|Identical to stable 2/2/33.
	\|-		\|-
	\|		\|

114.86.18.47 — Fri, 03 Apr 2026 15:34:31 GMT

← Older revision		Revision as of 15:34, 3 April 2026
(3 intermediate revisions by the same user not shown)
Line 484:		Line 484:
	\|Based on 105/5 adder.		\|Based on 105/5 adder.
	\|-		\|-
	\|Count Leading ~~Zeros~~		\|Count Leading Zeroes
			\|38
			\|3
			\| -
			\|114
			\|FermiEnergy & mqyxx
			\|
			\|-
			\|Count Leading Zeroes
	\|22		\|22
	\|4		\|4
Line 492:		Line 500:
	\|		\|
	\|-		\|-
	\|Count Leading ~~Zeros~~		\|Count Leading Zeroes
	\|19		\|19
	\|5		\|5
Line 804:		Line 812:
	\|1935		\|1935
	\|		\|
	\|		\|If the feature of the lowest two bits
			being always 0 is utilized, it can be

			208 * 9 = 1872.
	\|-		\|-
	\|Superscalar Counting		\|Superscalar Counting
Line 812:		Line 823:
	\|1960		\|1960
	\|		\|
	\|		\|If the feature of the lowest two bits
			being always 0 is utilized, it can be

			189 * 10 = 1890.
	\|-		\|-
	\|Superscalar Counting		\|Superscalar Counting
Line 820:		Line 834:
	\|2079		\|2079
	\|		\|
	\|		\|If the feature of the lowest two bits
			being always 0 is utilized, it can be

			182 * 11 = 2002.
	\|-		\|-
	\|Instruction Queue		\|Instruction Queue

82.77.240.44 — Mon, 30 Mar 2026 09:33:35 GMT

fixed grammar on alpha

← Older revision		Revision as of 09:33, 30 March 2026
Line 1:		Line 1:
	{{Breadcrumbs\|Alpha Branch/{{SUBPAGENAME}}}}		{{Breadcrumbs\|Alpha Branch/{{SUBPAGENAME}}}}
	{{Early-access-version\|2\|0.16\|~~apha~~}}		{{Early-access-version\|2\|0.16\|alpha}}

	A number of levels in version are known to be broken, and require some workarounds to complete. Some of these issues affect multiple levels, I only give the first level you are likely to come across them.		A number of levels in version are known to be broken, and require some workarounds to complete. Some of these issues affect multiple levels, I only give the first level you are likely to come across them.

202.120.235.9 — Sat, 28 Mar 2026 14:07:34 GMT

← Older revision		Revision as of 14:07, 28 March 2026
(5 intermediate revisions by the same user not shown)
Line 429:		Line 429:
	\|-		\|-
	\|Multiply		\|Multiply
	\|~~205~~		\|203
	\|13		\|13
	\| -		\| -
	\|~~2665~~		\|2639
	\|FermiEnergy & mqyxx		\|FermiEnergy & mqyxx
	\|		\|
Line 485:		Line 485:
	\|-		\|-
	\|Count Leading Zeros		\|Count Leading Zeros
	\|24		\|22
	\|4		\|4
	\| -		\| -
	\|96		\|88
	\|~~FermiEnergy & mqyxx~~		\|skyoxZ
	\|		\|
	\|-		\|-
	\|Count Leading Zeros		\|Count Leading Zeros
	\|22		\|19
	\|5		\|5
	\| -		\| -
	\|~~110~~		\|95
	~~\|FermiEnergy & mqyxx~~
	~~\|Switchless~~
	\|-
	~~\|Count Leading Zeros~~
	~~\|21~~
	\|6
	~~\| -~~
	~~\|126~~
	\|FermiEnergy & mqyxx		\|FermiEnergy & mqyxx
	\|Switchless		\|Switchless

Gelthor — Tue, 24 Mar 2026 11:41:02 GMT

$ replaced with $start

← Older revision		Revision as of 11:41, 24 March 2026
Line 226:		Line 226:

	==== Instruction Address ====		==== Instruction Address ====
	The special ~~character~~ <code>$</code> returns the memory address of the start of the current instruction. This is useful for instructions such as relative jumps. If we assume <code>0b01000000</code> is the opcode for an absolute unconditional jump, we can use the following example to create a relative jump instruction without any additional hardware:		The special variable <code>$start</code> returns the memory address of the start of the current instruction. This is useful for instructions such as relative jumps. If we assume <code>0b01000000</code> is the opcode for an absolute unconditional jump, we can use the following example to create a relative jump instruction without any additional hardware:
	<pre>		<pre>
	jmp_rel %offset:S16(immediate)		jmp_rel %offset:S16(immediate)
Line 233:		Line 233:
	</pre>		</pre>
	{{note\|type=info\|This instruction only will only work with immediate values. If you try to use a register, you would get the register index - not its contents - added to the instruction address.}}		{{note\|type=info\|This instruction only will only work with immediate values. If you try to use a register, you would get the register index - not its contents - added to the instruction address.}}

			The special variable <code>$end</code> returns the memory address of the end of the current instruction.

	==== Bit slicing ====		==== Bit slicing ====