Last Sync: 2022-08-20 12:30:04

This commit is contained in:
tactonbishop 2022-08-20 12:30:04 +01:00
parent 8a14d39935
commit fc5e97fb77
29 changed files with 104 additions and 93 deletions

View file

@ -1,9 +1,9 @@
--- ---
tags: categories:
- Mathematics - Mathematics
- binary - Computer_Architecture
tags: [binary]
--- ---
# Binary arithmetic # Binary arithmetic
## Binary addition ## Binary addition

View file

@ -1,7 +1,8 @@
--- ---
tags: categories:
- electronics - Computer_Architecture
- binary - Electronics
tags: [binary]
--- ---
# Binary arithmetic with circuits # Binary arithmetic with circuits

View file

@ -1,8 +1,10 @@
--- ---
tags: categories:
- Mathematics - Mathematics
- binary - Computer_Architecture
tags: [binary]
--- ---
# The binary number system # The binary number system
## Decimal (denary) number system ## Decimal (denary) number system

View file

@ -1,7 +1,8 @@
--- ---
tags: categories:
- Theory_of_Computation - Mathematics
- binary - Computer_Architecture
tags: [binary]
--- ---
# Why computers use binary # Why computers use binary

View file

@ -1,9 +1,11 @@
--- ---
tags: categories:
- Computer_Architecture
- Hardware - Hardware
- motherboard tags: [motherboard]
--- ---
#
# Bus # Bus
A bus is a communication system that transfers data between components inside a computer, or between computers. A bus is a communication system that transfers data between components inside a computer, or between computers.

View file

@ -1,8 +1,7 @@
--- ---
tags: categories:
- Hardware - Computer_Architecture
- cpu tags: [CPU]
- von_neumann
--- ---
# CPU architecture # CPU architecture

View file

@ -1,9 +1,10 @@
--- ---
tags: categories:
- Hardware - Computer_Architecture
- cpu tags: [CPU]
--- ---
# Fetch, decode, execute, store # 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). *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).

View file

@ -1,7 +1,7 @@
--- ---
tags: categories:
- Hardware - Computer_Architecture
- cpu tags: [CPU]
--- ---
# CPU: Introduction # CPU: Introduction

View file

@ -1,3 +1,9 @@
---
categories:
- Computer_Architecture
tags: [CPU, processors]
---
## The Little Man Computer ## The Little Man Computer
// TODO: Improve notes and learn how to use // TODO: Improve notes and learn how to use

View file

@ -1,10 +1,11 @@
--- ---
tags: categories:
- Computer_Architecture
- Hardware - Hardware
- memory tags: [motherboard, chipset]
- motherboard
--- ---
# Chipset and controllers # 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. A **controller** is simply a circuit that controls a process. The **chipset** is a combination of controllers placed on the same piece of silicon.

View file

@ -1,9 +1,9 @@
--- ---
tags: categories:
- Logic - Computer_Architecture
- Electronics - Electronics
- Hardware - Hardware
- logic-gates tags: [logic_gates]
--- ---
# AND gate # AND gate

View file

@ -1,8 +1,9 @@
--- ---
tags: categories:
- Logic - Computer_Architecture
- Electronics - Electronics
- binary - Hardware
tags: [logic_gates, binary]
--- ---
# Logic circuits # Logic circuits

View file

@ -1,9 +1,9 @@
--- ---
tags: categories:
- Logic - Computer_Architecture
- Electronics - Electronics
- Hardware - Hardware
- logic-gates tags: [logic_gates, binary]
--- ---
# Logic gates # Logic gates

View file

@ -1,9 +1,9 @@
--- ---
tags: categories:
- Logic - Computer_Architecture
- Electronics - Electronics
- Hardware - Hardware
- logic_gates tags: [logic_gates, binary]
--- ---
# NAND gate # NAND gate

View file

@ -1,10 +1,11 @@
--- ---
tags: categories:
- Logic - Computer_Architecture
- Electronics - Electronics
- Hardware - Hardware
- logic-gates tags: [logic_gates, binary]
--- ---
# NOT gate # NOT gate
This gate corresponds to the negation logical connective. This gate corresponds to the negation logical connective.

View file

@ -1,9 +1,9 @@
--- ---
tags: categories:
- Logic - Computer_Architecture
- Electronics - Electronics
- Hardware - Hardware
- logic-gates tags: [logic_gates, binary]
--- ---
# OR gate # OR gate

View file

@ -1,9 +1,9 @@
--- ---
tags: categories:
- Logic - Computer_Architecture
- Electronics - Electronics
- Hardware - Hardware
- logic-gates tags: [logic_gates, binary]
--- ---
# XOR gate # XOR gate

View file

@ -1,8 +1,8 @@
--- ---
tags: categories:
- Computer_Architecture
- Hardware - Hardware
- memory tags: [memory, motherboard]
- motherboard
--- ---
# Memory # Memory

View file

@ -1,7 +1,7 @@
--- ---
tags: categories:
- Hardware - Computer_Architecture
- memory tags: [memory]
--- ---
# The role of memory in computation # The role of memory in computation

View file

@ -1,9 +1,9 @@
--- ---
tags: categories:
- Electronics - Computer_Architecture
- Hardware - Hardware
tags: [motherboard]
--- ---
# Motherboard # Motherboard
<img src="../img/motherboard-pi.jpg" width="400px"/> <img src="../img/motherboard-pi.jpg" width="400px"/>

View file

@ -1,7 +1,7 @@
--- ---
tags: categories:
- Linux - Linux
- networking tags: []
--- ---
# Bluetooth # Bluetooth

View file

@ -1,8 +1,8 @@
--- ---
tags: categories:
- Linux - Linux
tags: [make]
--- ---
# Compile package from source # Compile package from source
1. Clone the repo from GitHub 1. Clone the repo from GitHub

View file

@ -1,8 +1,10 @@
--- ---
tags: categories:
- Linux - Linux
tags: []
--- ---
# Pacman # Pacman
## List all installed packages ## List all installed packages

View file

@ -1,8 +1,8 @@
--- ---
tags: categories:
- Linux - Linux
tags: [user_management]
--- ---
# User management # User management
## Switch user ## Switch user

View file

@ -1,10 +1,10 @@
--- ---
categories: categories:
- Linux - Linux
- Operating_Systems tags: [systems_programming, systemd]
tags: [user_space, 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. 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.

View file

@ -1,8 +1,7 @@
--- ---
tags: categories:
- Logic - Logic
- propositional-logic tags: [propositional_logic]
- derivation-rules
--- ---
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. 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.

View file

@ -1,10 +1,8 @@
--- ---
tags: categories:
- Logic - Logic
- propositional-logic tags: [propositional_logic]
- derivation-rules
--- ---
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. 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.
![bi-intro.png](../img/bi-intro.png) ![bi-intro.png](../img/bi-intro.png)

View file

@ -1,8 +1,7 @@
--- ---
tags: categories:
- Logic - Logic
- propositional-logic tags: [propositional_logic]
- derivation-rules
--- ---
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). 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).

View file

@ -1,9 +1,7 @@
--- ---
title: Conditional introduction categories:
tags:
- Logic - Logic
- propositional-logic tags: [propositional_logic]
- derivation-rules
--- ---
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_ 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_