home.social

#logicgate — Public Fediverse posts

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

  1. For #genuary7, Boolean Algebra, this image simulates a set of stacked logic gates, with gate type and signal state represented by colors.

    #genuary #genuary2026 #boolean #logicgate

  2. For #genuary7, Boolean Algebra, this image simulates a set of stacked logic gates, with gate type and signal state represented by colors.

    #genuary #genuary2026 #boolean #logicgate

  3. For #genuary7, Boolean Algebra, this image simulates a set of stacked logic gates, with gate type and signal state represented by colors.

    #genuary #genuary2026 #boolean #logicgate

  4. For #genuary7, Boolean Algebra, this image simulates a set of stacked logic gates, with gate type and signal state represented by colors.

    #genuary #genuary2026 #boolean #logicgate

  5. For #genuary7, Boolean Algebra, this image simulates a set of stacked logic gates, with gate type and signal state represented by colors.

    #genuary #genuary2026 #boolean #logicgate

  6. Transistor: Những công tắc nhỏ tạo nên thế giới số 🌐
    Mỗi máy tính, điện thoại hay AI đều hoạt động nhờ hàng tỷ transistor – linh kiện bán dẫn đóng vai trò công tắc ON/OFF, biểu diễn dữ liệu dưới dạng 0 và 1. Thay thế đèn chân không, transistor nhỏ, nhanh, tiết kiệm điện và cực kỳ đáng tin cậy. Chúng tạo nên các cổng logic, CPU, RAM và mọi thành phần xử lý. Không có transistor, không có công nghệ hiện đại.

    #Transistor #ComputerScience #KhoaHocMayTinh #LogicGate #CPU #CôngNghệ #MáyTính #Tech

  7. 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

  8. Computer Logic Spins with No Electricity - We’ve often said you can make a logic gate out of darn near anything. [The Action ... - hackaday.com/2024/01/21/comput #spintronics #logicgate #toyhacks

  9. the puff adder: actually just spicy xor and some hot air

    #xor
    #logicGate
    #joke

  10. 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

  11. 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

  12. 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

  13. 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