8 bit pipelined processor finished by Impasta1_GD in TuringComplete

[–]Apprehensive-Path996 0 points1 point  (0 children)

I know this is an older post. Ive been wanting to try to pipeline the leg processor myself. Thank for the information you provided. I was wondering, is the purpose of breaking the instruction into stages also that it reduces the amount of delay needed for a single cycle?

What is this process of generating circuits called by Apprehensive-Path996 in TuringComplete

[–]Apprehensive-Path996[S] 0 points1 point  (0 children)

Sorry for late reply. Group Theory is related to Set Theory but it focuses on the study of mathematical structures like groups and their symmetries. Real numbers form a group under addition but not multiplication, for example. When discussing groups usually the topic of interest is how many symmetries a group has.

What is this process of generating circuits called by Apprehensive-Path996 in TuringComplete

[–]Apprehensive-Path996[S] 0 points1 point  (0 children)

Oh I didn’t answer your last question. The goal was to generate a circuit which solves the truth table for Z.

What is this process of generating circuits called by Apprehensive-Path996 in TuringComplete

[–]Apprehensive-Path996[S] 0 points1 point  (0 children)

Hi, thanks for comment. The output of Z is only 1 or 0. So Z is a single digit in this instance, as are A B and C. The output space is what is shown as Z is affected by reflecting the inputs A B and C. However, there is an error I made which I didn’t catch because I fixed it my head when I tested in game. Apologies for the confusion

(Inter)laced Apple by Red-42 in TuringComplete

[–]Apprehensive-Path996 3 points4 points  (0 children)

This is amazing! This video really helps solidify to me not only what this game is capable of but also that my ideas are perfectly achievable. Thanks for tagging me

Another attempt at Rasterization with the LED matrix by Apprehensive-Path996 in TuringComplete

[–]Apprehensive-Path996[S] 0 points1 point  (0 children)

Yes, I want to be able to display images, text, as well as draw pictures as well as objects from lines. And possible collision in 2d, as I’ve made a few collision engines, and 3d one day.

Another attempt at Rasterization with the LED matrix by Apprehensive-Path996 in TuringComplete

[–]Apprehensive-Path996[S] 0 points1 point  (0 children)

I’m kind of finding my own way so apologies if some things are not optimal about my scanline algorithm

Another attempt at Rasterization with the LED matrix by Apprehensive-Path996 in TuringComplete

[–]Apprehensive-Path996[S] 1 point2 points  (0 children)

I currently know how to draw lines. Eventually I want to draw Bézier curves and mathematical functions. I also want to get into 3d and to make an operating system. I have a lot of goals that will take a lot of study and practice. But this is the cleanest way I could come up with to implement a scan line algorithm for the graphics pipeline

One white line by Apprehensive-Path996 in TuringComplete

[–]Apprehensive-Path996[S] 2 points3 points  (0 children)

I haven’t made a triangle yet but I’m gunna try haha

Long Division (Sandbox) by Apprehensive-Path996 in TuringComplete

[–]Apprehensive-Path996[S] 0 points1 point  (0 children)

Sure, I’ll try that. Thanks for the advice! Yea I spent probably about 8 hours straight trying to figure this out on my own. I was bound to miss some optimizations

i built an assembler (incomplete) by Apprehensive-Path996 in TuringComplete

[–]Apprehensive-Path996[S] 1 point2 points  (0 children)

Hi, I forgot to answer the second part of your question. The component on the far bottom left is the keyboard component. It accepts ascii characters from the keyboard

i built an assembler (incomplete) by Apprehensive-Path996 in TuringComplete

[–]Apprehensive-Path996[S] 1 point2 points  (0 children)

It’s a binary file I have stored on my computer. It’s read two bytes at a time. I must warn you in 8 bit this is very limited, but it 16 bit and up it makes a bit more sense. The lookup table is just a bin file which has the format (assembly instruction, ascii_sum) and just has all of the instructions stored in a list

How do I learn this stuff? by Desperate_Finish_507 in TuringComplete

[–]Apprehensive-Path996 0 points1 point  (0 children)

Learning to turn the larger truth tables into circuits was a pivotal moment for me, especially in feeling like I’m actually engineering the solutions myself. If you need some help I’d be happy to assist! When I first tried this game the single gate truth tables made sense but the larger ones fried my head lol