home.social

#logicgates — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #logicgates, aggregated by home.social.

  1. Gamefinds: NANDgame
    NANDgame is one of those puzzle games that's really an educational game in disguise. By hooking up wires and relays, then logic gates, then larger pieces of basic computing hardware, you construct a basic processor from first principles, step by excruciating step.

    This is actually a puzzle solution, which I don't usually in
    setsideb.com/gamefinds-nandgam
    #gamefinds #indies #niche #ComputerArchitecture #gamefinds #indie #LogicGates #NANDgame #niche #puzzle

  2. Gamefinds: NANDgame
    NANDgame is one of those puzzle games that's really an educational game in disguise. By hooking up wires and relays, then logic gates, then larger pieces of basic computing hardware, you construct a basic processor from first principles, step by excruciating step.

    This is actually a puzzle solution, which I don't usually in
    setsideb.com/gamefinds-nandgam
    #gamefinds #indies #niche #ComputerArchitecture #gamefinds #indie #LogicGates #NANDgame #niche #puzzle

  3. Gamefinds: NANDgame
    NANDgame is one of those puzzle games that's really an educational game in disguise. By hooking up wires and relays, then logic gates, then larger pieces of basic computing hardware, you construct a basic processor from first principles, step by excruciating step.

    This is actually a puzzle solution, which I don't usually in
    setsideb.com/gamefinds-nandgam
    #gamefinds #indies #niche #ComputerArchitecture #gamefinds #indie #LogicGates #NANDgame #niche #puzzle

  4. Gamefinds: NANDgame
    NANDgame is one of those puzzle games that's really an educational game in disguise. By hooking up wires and relays, then logic gates, then larger pieces of basic computing hardware, you construct a basic processor from first principles, step by excruciating step.

    This is actually a puzzle solution, which I don't usually in
    setsideb.com/gamefinds-nandgam
    #gamefinds #indies #niche #ComputerArchitecture #gamefinds #indie #LogicGates #NANDgame #niche #puzzle

  5. Gamefinds: NANDgame
    NANDgame is one of those puzzle games that's really an educational game in disguise. By hooking up wires and relays, then logic gates, then larger pieces of basic computing hardware, you construct a basic processor from first principles, step by excruciating step.

    This is actually a puzzle solution, which I don't usually in
    setsideb.com/gamefinds-nandgam
    #gamefinds #indies #niche #ComputerArchitecture #gamefinds #indie #LogicGates #NANDgame #niche #puzzle

  6. Building Diode and Diode-Transistor Logic Gates - AND gate implemented as diode-resistor logic. (Credit: Anthony Francis-Jones)
    The ... - hackaday.com/2025/06/20/buildi #diode-transistorlogic #logicgates #how-to #dtl

  7. Building Diode and Diode-Transistor Logic Gates - AND gate implemented as diode-resistor logic. (Credit: Anthony Francis-Jones)
    The ... - hackaday.com/2025/06/20/buildi #diode-transistorlogic #logicgates #how-to #dtl

  8. Building Diode and Diode-Transistor Logic Gates - AND gate implemented as diode-resistor logic. (Credit: Anthony Francis-Jones)
    The ... - hackaday.com/2025/06/20/buildi #diode-transistorlogic #logicgates #how-to #dtl

  9. Building Diode and Diode-Transistor Logic Gates - AND gate implemented as diode-resistor logic. (Credit: Anthony Francis-Jones)
    The ... - hackaday.com/2025/06/20/buildi #diode-transistorlogic #logicgates #how-to #dtl

  10. Building Diode and Diode-Transistor Logic Gates - AND gate implemented as diode-resistor logic. (Credit: Anthony Francis-Jones)
    The ... - hackaday.com/2025/06/20/buildi #diode-transistorlogic #logicgates #how-to #dtl

  11. I build a section for #LogicGates on the #BlockHeadsSMP redstone world!

    pretty happy with the result :3 now we can always look them up while building and also directly test them out.

    there's multiple variants which get more compact and complex - in case someone wants to use them in farms and stuff!

    also books that explain briefly how the gates work, so peeps can learn from it!

    screenshots and credit: ko-fi.com/i/IL4L4168RJ5

    #Minecraft #MinecraftRedstone #TechnicalMinecraft

  12. I build a section for #LogicGates on the #BlockHeadsSMP redstone world!

    pretty happy with the result :3 now we can always look them up while building and also directly test them out.

    there's multiple variants which get more compact and complex - in case someone wants to use them in farms and stuff!

    also books that explain briefly how the gates work, so peeps can learn from it!

    screenshots and credit: ko-fi.com/i/IL4L4168RJ5

    #Minecraft #MinecraftRedstone #TechnicalMinecraft

  13. I build a section for #LogicGates on the #BlockHeadsSMP redstone world!

    pretty happy with the result :3 now we can always look them up while building and also directly test them out.

    there's multiple variants which get more compact and complex - in case someone wants to use them in farms and stuff!

    also books that explain briefly how the gates work, so peeps can learn from it!

    screenshots and credit: ko-fi.com/i/IL4L4168RJ5

    #Minecraft #MinecraftRedstone #TechnicalMinecraft

  14. I build a section for #LogicGates on the #BlockHeadsSMP redstone world!

    pretty happy with the result :3 now we can always look them up while building and also directly test them out.

    there's multiple variants which get more compact and complex - in case someone wants to use them in farms and stuff!

    also books that explain briefly how the gates work, so peeps can learn from it!

    screenshots and credit: ko-fi.com/i/IL4L4168RJ5

    #Minecraft #MinecraftRedstone #TechnicalMinecraft

  15. I build a section for #LogicGates on the #BlockHeadsSMP redstone world!

    pretty happy with the result :3 now we can always look them up while building and also directly test them out.

    there's multiple variants which get more compact and complex - in case someone wants to use them in farms and stuff!

    also books that explain briefly how the gates work, so peeps can learn from it!

    screenshots and credit: ko-fi.com/i/IL4L4168RJ5

    #Minecraft #MinecraftRedstone #TechnicalMinecraft

  16. Early today, we remembered the old Daddy Or Chips? advert.

    This got us to thinking that other logic gates must apply too to this question.

    So, which of the below would you choose?

    #DaddyOrChips #poll #LogicGates

  17. Early today, we remembered the old Daddy Or Chips? advert.

    This got us to thinking that other logic gates must apply too to this question.

    So, which of the below would you choose?

    #DaddyOrChips #poll #LogicGates

  18. Early today, we remembered the old Daddy Or Chips? advert.

    This got us to thinking that other logic gates must apply too to this question.

    So, which of the below would you choose?

    #DaddyOrChips #poll #LogicGates

  19. Early today, we remembered the old Daddy Or Chips? advert.

    This got us to thinking that other logic gates must apply too to this question.

    So, which of the below would you choose?

    #DaddyOrChips #poll #LogicGates

  20. Early today, we remembered the old Daddy Or Chips? advert.

    This got us to thinking that other logic gates must apply too to this question.

    So, which of the below would you choose?

    #DaddyOrChips #poll #LogicGates

  21. Are there limits to what computers can do? How complex is too complex for computation? The question of how hard a problem is to solve lies at the heart of an important field of computer science called Computational Complexity. Computational complexity theorists want to know which problems are practically solvable using clever algorithms and which problems are truly difficult, maybe even virtually impossible, for computers to crack. This hardness is central to what’s called the P versus NP problem, one of the most difficult and important questions in all of math and science.

    This video covers a wide range of topics including: the history of computer science, how transistor-based electronic computers solve problems using Boolean logical operations and algorithms, what is a Turing Machine, the different classes of problems, circuit complexity, and the emerging field of meta-complexity, where researchers study the self-referential nature of complexity questions.

    P vs. NP: The Biggest Puzzle in Computer Science

    #algorithm #algorithms #circuit #circuitDesign #circuits #CompSci #ComputerScience #computers #Logic #logicGate #logicGates #Math #Mathematics #microchip #microchips #QuantaMagazine #TuringMachines #YouTube

  22. Are there limits to what computers can do? How complex is too complex for computation? The question of how hard a problem is to solve lies at the heart of an important field of computer science called Computational Complexity. Computational complexity theorists want to know which problems are practically solvable using clever algorithms and which problems are truly difficult, maybe even virtually impossible, for computers to crack. This hardness is central to what’s called the P versus NP problem, one of the most difficult and important questions in all of math and science.

    This video covers a wide range of topics including: the history of computer science, how transistor-based electronic computers solve problems using Boolean logical operations and algorithms, what is a Turing Machine, the different classes of problems, circuit complexity, and the emerging field of meta-complexity, where researchers study the self-referential nature of complexity questions.

    P vs. NP: The Biggest Puzzle in Computer Science

    #algorithm #algorithms #circuit #circuitDesign #circuits #CompSci #ComputerScience #computers #Logic #logicGate #logicGates #Math #Mathematics #microchip #microchips #QuantaMagazine #TuringMachines #YouTube

  23. Are there limits to what computers can do? How complex is too complex for computation? The question of how hard a problem is to solve lies at the heart of an important field of computer science called Computational Complexity. Computational complexity theorists want to know which problems are practically solvable using clever algorithms and which problems are truly difficult, maybe even virtually impossible, for computers to crack. This hardness is central to what’s called the P versus NP problem, one of the most difficult and important questions in all of math and science.

    This video covers a wide range of topics including: the history of computer science, how transistor-based electronic computers solve problems using Boolean logical operations and algorithms, what is a Turing Machine, the different classes of problems, circuit complexity, and the emerging field of meta-complexity, where researchers study the self-referential nature of complexity questions.

    P vs. NP: The Biggest Puzzle in Computer Science

    #algorithm #algorithms #circuit #circuitDesign #circuits #CompSci #ComputerScience #computers #Logic #logicGate #logicGates #Math #Mathematics #microchip #microchips #QuantaMagazine #TuringMachines #YouTube

  24. Are there limits to what computers can do? How complex is too complex for computation? The question of how hard a problem is to solve lies at the heart of an important field of computer science called Computational Complexity. Computational complexity theorists want to know which problems are practically solvable using clever algorithms and which problems are truly difficult, maybe even virtually impossible, for computers to crack. This hardness is central to what’s called the P versus NP problem, one of the most difficult and important questions in all of math and science.

    This video covers a wide range of topics including: the history of computer science, how transistor-based electronic computers solve problems using Boolean logical operations and algorithms, what is a Turing Machine, the different classes of problems, circuit complexity, and the emerging field of meta-complexity, where researchers study the self-referential nature of complexity questions.

    P vs. NP: The Biggest Puzzle in Computer Science

    #algorithm #algorithms #circuit #circuitDesign #circuits #CompSci #ComputerScience #computers #Logic #logicGate #logicGates #Math #Mathematics #microchip #microchips #QuantaMagazine #TuringMachines #YouTube

  25. Are there limits to what computers can do? How complex is too complex for computation? The question of how hard a problem is to solve lies at the heart of an important field of computer science called Computational Complexity. Computational complexity theorists want to know which problems are practically solvable using clever algorithms and which problems are truly difficult, maybe even virtually impossible, for computers to crack. This hardness is central to what’s called the P versus NP problem, one of the most difficult and important questions in all of math and science.

    This video covers a wide range of topics including: the history of computer science, how transistor-based electronic computers solve problems using Boolean logical operations and algorithms, what is a Turing Machine, the different classes of problems, circuit complexity, and the emerging field of meta-complexity, where researchers study the self-referential nature of complexity questions.

    P vs. NP: The Biggest Puzzle in Computer Science

    #algorithm #algorithms #circuit #circuitDesign #circuits #CompSci #ComputerScience #computers #Logic #logicGate #logicGates #Math #Mathematics #microchip #microchips #QuantaMagazine #TuringMachines #YouTube

  26. Three logicians walk into a bar and are asked, "Do you all want a drink?"

    The first says, "I don't know."

    The second says, "I don't know."

    The third says, "Yes."

    #logical #mathjoke #logicgates

  27. Three logicians walk into a bar and are asked, "Do you all want a drink?"

    The first says, "I don't know."

    The second says, "I don't know."

    The third says, "Yes."

    #logical #mathjoke #logicgates

  28. Three logicians walk into a bar and are asked, "Do you all want a drink?"

    The first says, "I don't know."

    The second says, "I don't know."

    The third says, "Yes."

    #logical #mathjoke #logicgates

  29. Can anyone recommend some software that will let me some digital circuitry with a few hundred on a Mac? I have had a Cunning Idea which will almost certainly not work 🙂

  30. Can anyone recommend some software that will let me #simulate some digital circuitry with a few hundred #LogicGates on a Mac? I have had a Cunning Idea which will almost certainly not work 🙂