Last Sync: 2022-08-20 12:30:04
This commit is contained in:
parent
8a14d39935
commit
fc5e97fb77
29 changed files with 104 additions and 93 deletions
|
@ -1,9 +1,9 @@
|
|||
---
|
||||
tags:
|
||||
categories:
|
||||
- Mathematics
|
||||
- binary
|
||||
- Computer_Architecture
|
||||
tags: [binary]
|
||||
---
|
||||
|
||||
# Binary arithmetic
|
||||
|
||||
## Binary addition
|
||||
|
|
|
@ -1,7 +1,8 @@
|
|||
---
|
||||
tags:
|
||||
- electronics
|
||||
- binary
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Electronics
|
||||
tags: [binary]
|
||||
---
|
||||
|
||||
# Binary arithmetic with circuits
|
||||
|
|
|
@ -1,8 +1,10 @@
|
|||
---
|
||||
tags:
|
||||
categories:
|
||||
- Mathematics
|
||||
- binary
|
||||
- Computer_Architecture
|
||||
tags: [binary]
|
||||
---
|
||||
|
||||
# The binary number system
|
||||
|
||||
## Decimal (denary) number system
|
||||
|
|
|
@ -1,7 +1,8 @@
|
|||
---
|
||||
tags:
|
||||
- Theory_of_Computation
|
||||
- binary
|
||||
categories:
|
||||
- Mathematics
|
||||
- Computer_Architecture
|
||||
tags: [binary]
|
||||
---
|
||||
|
||||
# Why computers use binary
|
||||
|
|
|
@ -1,9 +1,11 @@
|
|||
---
|
||||
tags:
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Hardware
|
||||
- motherboard
|
||||
tags: [motherboard]
|
||||
---
|
||||
|
||||
#
|
||||
# Bus
|
||||
A bus is a communication system that transfers data between components inside a computer, or between computers.
|
||||
|
||||
|
|
|
@ -1,8 +1,7 @@
|
|||
---
|
||||
tags:
|
||||
- Hardware
|
||||
- cpu
|
||||
- von_neumann
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
tags: [CPU]
|
||||
---
|
||||
|
||||
# CPU architecture
|
||||
|
|
|
@ -1,9 +1,10 @@
|
|||
---
|
||||
tags:
|
||||
- Hardware
|
||||
- cpu
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
tags: [CPU]
|
||||
---
|
||||
|
||||
|
||||
# Fetch, decode, execute, store
|
||||
|
||||
*Fetch, decode, execute* is the operating cycle of the CPU. We will run through how this works with reference to the [CPU architecture](/Hardware/CPU/CPU_architecture.md).
|
||||
|
|
|
@ -1,7 +1,7 @@
|
|||
---
|
||||
tags:
|
||||
- Hardware
|
||||
- cpu
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
tags: [CPU]
|
||||
---
|
||||
|
||||
# CPU: Introduction
|
||||
|
|
|
@ -1,3 +1,9 @@
|
|||
---
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
tags: [CPU, processors]
|
||||
|
||||
---
|
||||
## The Little Man Computer
|
||||
|
||||
// TODO: Improve notes and learn how to use
|
||||
|
|
|
@ -1,10 +1,11 @@
|
|||
---
|
||||
tags:
|
||||
- Hardware
|
||||
- memory
|
||||
- motherboard
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Hardware
|
||||
tags: [motherboard, chipset]
|
||||
---
|
||||
|
||||
|
||||
# Chipset and controllers
|
||||
|
||||
A **controller** is simply a circuit that controls a process. The **chipset** is a combination of controllers placed on the same piece of silicon.
|
||||
|
|
|
@ -1,9 +1,9 @@
|
|||
---
|
||||
tags:
|
||||
- Logic
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Electronics
|
||||
- Hardware
|
||||
- logic-gates
|
||||
tags: [logic_gates]
|
||||
---
|
||||
# AND gate
|
||||
|
||||
|
|
|
@ -1,8 +1,9 @@
|
|||
---
|
||||
tags:
|
||||
- Logic
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Electronics
|
||||
- binary
|
||||
- Hardware
|
||||
tags: [logic_gates, binary]
|
||||
---
|
||||
|
||||
# Logic circuits
|
||||
|
|
|
@ -1,9 +1,9 @@
|
|||
---
|
||||
tags:
|
||||
- Logic
|
||||
- Electronics
|
||||
- Hardware
|
||||
- logic-gates
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Electronics
|
||||
- Hardware
|
||||
tags: [logic_gates, binary]
|
||||
---
|
||||
|
||||
# Logic gates
|
||||
|
|
|
@ -1,9 +1,9 @@
|
|||
---
|
||||
tags:
|
||||
- Logic
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Electronics
|
||||
- Hardware
|
||||
- logic_gates
|
||||
tags: [logic_gates, binary]
|
||||
---
|
||||
|
||||
# NAND gate
|
||||
|
|
|
@ -1,10 +1,11 @@
|
|||
---
|
||||
tags:
|
||||
- Logic
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Electronics
|
||||
- Hardware
|
||||
- logic-gates
|
||||
tags: [logic_gates, binary]
|
||||
---
|
||||
|
||||
# NOT gate
|
||||
|
||||
This gate corresponds to the negation logical connective.
|
||||
|
|
|
@ -1,9 +1,9 @@
|
|||
---
|
||||
tags:
|
||||
- Logic
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Electronics
|
||||
- Hardware
|
||||
- logic-gates
|
||||
tags: [logic_gates, binary]
|
||||
---
|
||||
|
||||
# OR gate
|
||||
|
|
|
@ -1,9 +1,9 @@
|
|||
---
|
||||
tags:
|
||||
- Logic
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Electronics
|
||||
- Hardware
|
||||
- logic-gates
|
||||
tags: [logic_gates, binary]
|
||||
---
|
||||
|
||||
# XOR gate
|
||||
|
|
|
@ -1,8 +1,8 @@
|
|||
---
|
||||
tags:
|
||||
- Hardware
|
||||
- memory
|
||||
- motherboard
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Hardware
|
||||
tags: [memory, motherboard]
|
||||
---
|
||||
|
||||
# Memory
|
||||
|
|
|
@ -1,7 +1,7 @@
|
|||
---
|
||||
tags:
|
||||
- Hardware
|
||||
- memory
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
tags: [memory]
|
||||
---
|
||||
|
||||
# The role of memory in computation
|
||||
|
|
|
@ -1,9 +1,9 @@
|
|||
---
|
||||
tags:
|
||||
- Electronics
|
||||
categories:
|
||||
- Computer_Architecture
|
||||
- Hardware
|
||||
tags: [motherboard]
|
||||
---
|
||||
|
||||
# Motherboard
|
||||
|
||||
<img src="../img/motherboard-pi.jpg" width="400px"/>
|
||||
|
|
|
@ -1,7 +1,7 @@
|
|||
---
|
||||
tags:
|
||||
- Linux
|
||||
- networking
|
||||
categories:
|
||||
- Linux
|
||||
tags: []
|
||||
---
|
||||
|
||||
# Bluetooth
|
||||
|
|
|
@ -1,8 +1,8 @@
|
|||
---
|
||||
tags:
|
||||
- Linux
|
||||
categories:
|
||||
- Linux
|
||||
tags: [make]
|
||||
---
|
||||
|
||||
# Compile package from source
|
||||
|
||||
1. Clone the repo from GitHub
|
||||
|
|
|
@ -1,8 +1,10 @@
|
|||
---
|
||||
tags:
|
||||
- Linux
|
||||
categories:
|
||||
- Linux
|
||||
tags: []
|
||||
---
|
||||
|
||||
|
||||
# Pacman
|
||||
|
||||
## List all installed packages
|
||||
|
|
|
@ -1,8 +1,8 @@
|
|||
---
|
||||
tags:
|
||||
- Linux
|
||||
categories:
|
||||
- Linux
|
||||
tags: [user_management]
|
||||
---
|
||||
|
||||
# User management
|
||||
|
||||
## Switch user
|
||||
|
|
|
@ -1,10 +1,10 @@
|
|||
---
|
||||
categories:
|
||||
- Linux
|
||||
- Operating_Systems
|
||||
tags: [user_space, systems_programming]
|
||||
categories:
|
||||
- Linux
|
||||
tags: [systems_programming, systemd]
|
||||
---
|
||||
|
||||
|
||||
# `systemd`
|
||||
|
||||
Once the [boot process](/Operating_Systems/Boot_process.md) has completed and the bootloader has located the kernel and injected it into memory the first user space program runs: `init` (for _initialisation_). `init` is a [daemon](/Operating_Systems/Daemons.md) process that continues running until shutdown and is responsible for starting all the processes that are prerequisites for user space. For example: network connections, disk access, user logins etc.
|
||||
|
|
|
@ -1,8 +1,7 @@
|
|||
---
|
||||
tags:
|
||||
- Logic
|
||||
- propositional-logic
|
||||
- derivation-rules
|
||||
categories:
|
||||
- Logic
|
||||
tags: [propositional_logic]
|
||||
---
|
||||
|
||||
Give that the biconditional means that if $P$ is the case, $Q$ is the case and if $Q$ is the case, $P$ must be the case, if we have $P \equiv Q$ and $P$, we can derive $Q$ and vice versa.
|
||||
|
|
|
@ -1,10 +1,8 @@
|
|||
---
|
||||
tags:
|
||||
- Logic
|
||||
- propositional-logic
|
||||
- derivation-rules
|
||||
categories:
|
||||
- Logic
|
||||
tags: [propositional_logic]
|
||||
---
|
||||
|
||||
The biconditional means if $P$ is the case, $Q$ is the case and if $Q$ is the case, $P$ must be the case. Thus to introduce this operator we must demonstrate both that $Q$ follows from $P$ and that $P$ follows from $Q$. We do this via two sub-proofs.
|
||||
|
||||

|
||||
|
|
|
@ -1,8 +1,7 @@
|
|||
---
|
||||
tags:
|
||||
- Logic
|
||||
- propositional-logic
|
||||
- derivation-rules
|
||||
categories:
|
||||
- Logic
|
||||
tags: [propositional_logic]
|
||||
---
|
||||
|
||||
If we have a conditional and we have independently derived its antecedent, we may invoke its consequent. This is often referred to as *Modus ponens* (affirming the antecedent).
|
||||
|
|
|
@ -1,9 +1,7 @@
|
|||
---
|
||||
title: Conditional introduction
|
||||
tags:
|
||||
- Logic
|
||||
- propositional-logic
|
||||
- derivation-rules
|
||||
categories:
|
||||
- Logic
|
||||
tags: [propositional_logic]
|
||||
---
|
||||
|
||||
If we can show that $Q$ follows from $P$ (typically via a subproof) than we can assert that P implies Q. This is also sometimes known as _Conditional Proof_
|
||||
|
|
Loading…
Add table
Reference in a new issue