Absolutely. And I actually think this is a really good way to study this course: instead of memorizing explanations, collect the questions that expose the layers underneath the computer.

Here’s a research checklist based on what you’ve asked so far, followed by questions I think you should ask as you go deeper.

Questions you’ve already asked

#QuestionShort answer
1What is a transistor?An electronic device that can control the flow of current, allowing it to act like a tiny switch or amplifier.
2How can electrical signals represent 0 and 1?Different voltage ranges are assigned the meanings 0 and 1.
3How can you make a logic gate from transistors?Arrange transistors so their electrical switching behavior produces a desired input/output relationship.
4How does a transistor actually act like a switch?A control voltage changes whether a conductive path exists between other terminals.
5How does an electrical circuit become a NOT/AND/OR gate?Its transistor arrangement causes specific combinations of input voltages to produce specific output voltages.
6If everything is electrical signals, where does the “logic” come from?Logic is a mathematical abstraction describing predictable electrical behavior.
7How do multiple transistors form a gate?Their switching paths are combined in particular configurations, such as series/parallel transistor networks.
8How do logic gates perform addition?XOR produces the sum bit and AND detects the carry bit.
9Why do AND + XOR produce addition?Because their truth tables match the two outputs needed for binary addition.
10What happens with 1 + 1?XOR gives 0 and AND gives 1, producing 10₂.
11How do you know what an electrical output means?The system’s design and conventions determine how a particular bit pattern is interpreted.
12Does the transistor know it’s doing logic or mathematics?No. It’s simply obeying physics; humans design and interpret the resulting behavior.
13Does a bit pattern inherently have meaning?No. 01000001, for example, can mean a number, character, data, or instruction depending on context.
14What do buffers do?They mainly strengthen/isolate signals and help drive other circuits; they don’t assign meaning to data.
15How do simple gates eventually become a CPU?Gates are combined into adders, multiplexers, registers, ALUs, control logic, and other larger circuits.
16How does the CPU know what an instruction means?The ISA defines what particular bit patterns mean, and decoder/control circuits turn them into control signals.
17How does a CPU execute an instruction?Roughly: fetch → decode → execute → memory access → write back.
18How does something physical eventually become software?Software is translated through layers: programming language → compiler → machine instructions → electrical activity in CPU circuits.

This is where I’d build your research rabbit-hole checklist. 😂

🧱 Level 1 — Electricity

Before even getting serious about transistors:

  1. What exactly is electric charge?
  2. What is voltage?
  3. What is current?
  4. What is resistance?
  5. What’s the difference between voltage and current?
  6. Why does voltage cause current to flow?
  7. What is an electric field?
  8. What is a circuit?
  9. Why does current need a complete path?
  10. What actually moves through a wire?
  11. What happens when a voltage changes?
  12. What is a digital signal versus an analog signal?

⚛️ Level 2 — Semiconductor physics

Now you’re getting underneath the transistor.

  1. What makes a material a semiconductor?
  2. Why is silicon useful for computers?
  3. What is an electron?
  4. What is a hole in semiconductor physics?
  5. What is doping?
  6. What are N-type and P-type semiconductors?
  7. What is a PN junction?
  8. What is a depletion region?
  9. What is a diode?
  10. Why does a diode allow current to flow preferentially in one direction?
  11. How does an electric field affect electrons?

🔬 Level 3 — The transistor

Then attack the transistor properly.

  1. What exactly is a MOSFET?
  2. What are source, drain, and gate?
  3. How does the gate control current?
  4. What physically happens inside a MOSFET when it turns ON?
  5. What physically happens when it turns OFF?
  6. Why do we have NMOS and PMOS?
  7. Why is CMOS useful?
  8. How does a CMOS inverter work?
  9. Why does CMOS consume very little static power?
  10. What determines transistor switching speed?
  11. What limits how small a transistor can become?
  12. How are billions of transistors manufactured on one chip?

🧮 Level 4 — Logic

Now you get into the thing you just discovered.

  1. What is Boolean algebra?
  2. Why does Boolean algebra use only 0 and 1?
  3. How are NOT, AND, and OR physically implemented?
  4. What are NAND and NOR gates?
  5. Why are NAND and NOR called universal gates?
  6. Can every logical operation be constructed from NAND alone?
  7. How is XOR physically constructed?
  8. Why does XOR correspond to “different”?
  9. What is a truth table?
  10. How do you derive a circuit from a truth table?
  11. How do you derive a truth table from a circuit?
  12. What is Boolean simplification?
  13. What are Karnaugh maps?

➕ Level 5 — From logic to computation

This is the section you’re entering now.

  1. What is a half adder?
  2. Why does a half adder need both SUM and CARRY?
  3. What is a full adder?
  4. How do you build a full adder from logic gates?
  5. How do you chain full adders together?
  6. How does an 8-bit adder work?
  7. How does subtraction work using the same hardware?
  8. How does binary multiplication work in hardware?
  9. How does a comparator determine whether A > B?
  10. What is a multiplexer?
  11. How does a multiplexer physically choose between signals?
  12. What is a decoder?
  13. How can a decoder turn a bit pattern into a specific control signal?

That last question is especially important for your earlier confusion about “how does the computer know what the output does?”


🧠 Level 6 — Memory

At this point you’ll hit another “WAIT WHAT?” moment.

  1. How can transistors remember something?
  2. What does it mean physically to store a bit?
  3. What is a latch?
  4. What is a flip-flop?
  5. How can feedback create memory?
  6. What is a register?
  7. How is a register built from flip-flops?
  8. How does SRAM store a bit?
  9. How does DRAM store a bit?
  10. Why does DRAM need refreshing?
  11. What is a clock signal?
  12. Why does a computer need a clock?

🖥️ Level 7 — Build the CPU

Now we’re assembling the Lego pieces.

  1. What is an ALU?
  2. How is an ALU constructed from smaller circuits?
  3. What is a datapath?
  4. What is a control unit?
  5. How does the control unit control the datapath?
  6. What is an instruction register?
  7. What is a program counter?
  8. How does the CPU fetch an instruction from memory?
  9. How does the CPU decode an instruction?
  10. How does an instruction decoder work physically?
  11. How does the CPU know which register to read?
  12. How does the CPU know which operation the ALU should perform?
  13. How does the CPU write the result back?

And eventually:

Can I design a tiny CPU myself using these concepts?

Yes. That’s basically where your eventual PRIME-1 project can come from.


🧾 Level 8 — Machine language

Now ask:

  1. What exactly is machine code?
  2. What is an instruction encoding?
  3. What is an opcode?
  4. What are operands?
  5. Why does an instruction need fields?
  6. What does an instruction like ADD R1, R2 become in binary?
  7. How does the CPU distinguish an ADD instruction from a LOAD instruction?
  8. What is an ISA?
  9. Why is the ISA considered an interface between software and hardware?
  10. What is the difference between an ISA and a CPU implementation?

👨🏽‍💻 Level 9 — Assembly → compiler → programming language

And this finally brings you back to the software world you’re already comfortable with.

  1. What is assembly language?
  2. Why was assembly created if machine code already exists?
  3. What does an assembler actually do?
  4. What is a compiler?
  5. How does a + b eventually become machine code?
  6. What does a compiler do first?
  7. What is lexical analysis?
  8. What is parsing?
  9. What is an AST?
  10. What is semantic analysis?
  11. What is intermediate representation?
  12. How does the compiler generate machine instructions?
  13. What is linking?
  14. What is an executable file?
  15. How does the OS load that executable into memory?
  16. How does the CPU eventually execute it?

🤯 And the ultimate question

Once you’ve gone through all of that, come back to this:

“If I write a = b + c in a programming language, can I trace that single statement all the way down to electrons physically moving through transistors?”

Yes.

Not every electron individually in a practical sense, but conceptually you can trace the chain:

a = b + c
      ↓
Programming language
      ↓
Compiler
      ↓
Machine instructions
      ↓
ISA
      ↓
CPU control signals
      ↓
Datapath
      ↓
ALU
      ↓
Adders
      ↓
XOR / AND / OR / MUX
      ↓
Transistor switching
      ↓
Voltages / currents
      ↓
Semiconductor physics

And that is basically the entire reason we’re doing this course from the bottom up.

If you research these questions in roughly this order, you’ll stop seeing a CPU as some mysterious black box and start seeing it as a gigantic hierarchy of very understandable little machines sitting on top of physics.

↑ Back to How Computers Work