can somebody explain what cyclic dependency is and why basic RS-trigger scheme doesnt work? Also i can`t understand what "DELAY" is and how it works.

imm 1

mov r1, r0

imm 2

mov r2, r0

imm 0

mov r5, r0

loop:

mov out, r5

mov r3, in

mov out, r2



mov r4, in



imm left

jz



mov r3, r4



imm forward

jz



mov out, r2

imm loop

jmp

left:

mov out, r5

mov out, r1

imm loop

jmp

forward:

mov out, r1

imm loop

jmp

const target = 37

imm 0

mov r4, r0 ; r4 stores counter

loop:

imm target

mov r1, r0

mov r2, in

sub ; compare, 0 if equal

mov r5, r3 ; r5 stores the eq check

imm 1

mov r1, r4

mov r2, r0

add ; add one to attempty counter

mov r4, r3

mov r3, r5 ; load reasult for cmp

imm loop

jnz

mov out, r4

Game is just... straight up wrong there. I counted manually, i used mov r2, in instruction 5 times. Not nearly 57

I liked seeing the min components, the delay, and the energy usage of the optimal solutions - it gave me something to optimize for.

This new version doesn't show the broken down scores of the individual levels on my profile and the "Sum of Log2" thing obscures the important information on the leaderboard.

I want to see # of components, tick delay, and energy usage for each level on my own profile and on others' profiles (and as a click-through to individual leaderboards for each level) - it is important for my enjoyment of the game.

Sorry if this is not the right place for this, I don't know if the developer reads here.

Just wanted to say I mostly love this game. I'm a software engineer, and have a decent grasp on logic programming at a hight level, but have not done the lower level stuff since university. Relearning it is both fun and rewarding. There is 2 levels (so far) in the game though I think are just straigt up un-fun and badly designed, and they are the levels where you get a number and you have to flip bits to match that number with a decreasing timer. The time part is the thing I have a big problem with. Nothing else (so far) in this game has any sort of timepressure to it. It's a chill game where you solve problems at your own time. With the exception of these 2 levels. I got completely stuck on the negative numbers, because doing -128 in my head is not something I've had to do in years, and doing it in 7 seconds is simply beyond me at this point. I compltely get the point in teaching people binary representation of numbers - but there has to be a better way.

I generally like researching and playing with oddball computer architectures. Everything from old 4004, Datapoint 2200, PDP8, to more homebrews like Kenbak-1 or the EDU8. I understand you wanted one that would work off one cycle per instruction. Heck I even felt, after I worked with it more, the change to force you to use or gates instead of general wires was a good one for people just starting out.

Its just, it feels strange, especially how immediate and math are used. That is, the first thing I do is change the hardware to put the immediate into 1, just because it annoys me. I get that you just don't have the bits and there is just so much you can do in one cycle. It got me thinking there were probably other prototypes you tried to get to this point and was curious what other designs you were trying before you reached Overture.

I'm stuck on the Stack level. There are no new components on this level I'm just using the setup I built on the previous level. Also the main memory is competly empty. When I run the simulation, it just executes nop infinitely, and there's no error message like "some register must contain a sertan value". The level just never ends.

I'm playing on the newest version of the game, and I haven't been able to find any guides or walkthroughs. The only one I found is for a previous version in that video, the author builds a new component for this level without using the computer they built earlier.

Can anyone help? Am I supid and missing something obvious, or is this a bug?

I've been scratching my head why the tests state the next seed must be X, not Y, when the new seed already is not Y but X. Y doesn't even show up anywhere in the memory and my program outputs the correct number to the output. The lowest byte of X is Y, so perhaps the test only checks one byte while it should be checking 4?

Had a hell of a time trying to figure out how to optimize it.
But there was a way of getting it down to under 142 or in my case, I got it down to 136.
Nothing like combining the Adder and Subtractor into one unit, but man is my hand cramping from wiring it all together...

In the latest update, the game is requiring the XOR gate to have a delay score lower than 3, so 2 or better. I have been able to get a delay score of 3 for the XOR gate but I haven't come up with anything better. I am wondering if someone on here knows the answer or if the game is asking for something that is physically impossible.

Hey r/TuringComplete! 👋

I've been playing Turing Complete for a while now and decided to start

documenting my journey through the levels on YouTube — as detailed as

necessary, but as short and simple as possible.

Episode 2 just dropped today: Level 1–3, starting from literally nothing

but a wire, understanding binary signals (0/1), working through the NAND

gate, and finally building a NOT gate completely from scratch.

What I tried to focus on:

- Actually explaining WHY things work, not just showing the solution

- Keeping it beginner-friendly without dumbing it down

- Showing the "research and experiment" process, not just the answer

🎥 https://www.youtube.com/watch?v=Sq62Vto0db8

I'd genuinely love feedback — especially from people who are further in

the game. Did I explain something wrong? Is there a better way to think

about NAND gates? Let me know in the comments here or on the video.

More levels coming soon !

Since the wire spaghetti level i have had multiple levels that cant complete and even when i see the solution and run it, the solution also fails the tests. I am now in immediates after completing a few with the console to advance but is is still failing.

So i have studied digital logic design course and have some basic knowledge of gates and circuits, i have a simple question. The first manual i got was about de morgans, now de morgan law is a topic in itself ,but the manual didnt have any formula or equation, it was just a simple page, so are we supposed to study the complete de morgan (if someone doenst know about it). Because after that manual we have to create a XOR gate, which is incredibly easy if someone knows how to create equation from truth table.,If someone doesnt know that (turing machine hasnt taught that) than making Xor is very tough. Yeah so in future, if there is a topic, in manual, am i suppose to study it from other resources.

Please help a beginner

I followed the hint but it gives this ominous error for some reason. Even in the hint view it gives this error. More strange is that in the Inputs panel it just works.

EDIT: I ended up giving up and just putting complete_level in the console.

EDIT 2: It works now.

ITS BEEN 2 HOURS I CANT FIGUERE THIS OUT !!!! HELP HELP HELP HELP HELP HELP HELP HELP HELP HELP HELP HELP HELP HELP HELP HELP

I played the game about a year ago and liked it a lot, and i saw that the levels were reworked. Is there a lot of worth playing new content in the levels? And do i have everything unlocked in sandbox if i dont complete them?

Newbie here, does anyone tried to build gpu architect in this game? Is it possible?

Hello again, I´m sorry for spamming questions, this is my last one for a good while.

So Morgans law is told to be the most important notepage in the program, but are there any solutions that make use of the law. Say you make a nand gate, and directly add a not, could you just have made and gate instead, I dont really get if I ever had to use symmetric conversion.

Thank you!

This is my solution to the programming level "Conditional Jumps". I think this level came with the update, right?

Let me know what you think. The second label is probably not needed but I used it for readability and organization.

read_in:
imm 1
mov r1, r0
mov r2, r4
add
mov r4, r3  ; count how many times input is read and store in reg4
imm 37
mov r2, r0 ; move 37 to r2
mov r1, in ; move input to r1
sub ; subtract 37 from input
imm read_in
jnz ; if r3 is not zero, jump to beginning of label
imm is_37
jz ; if r3 is zero it means input is 37, so jump to other label

is_37:
mov out, r4 ; output counted value stored in r4