From 0f1a5f56648e92ff3eea303a61dfc478c4cab12d Mon Sep 17 00:00:00 2001 From: thomasabishop Date: Sat, 19 Oct 2024 10:00:02 +0100 Subject: [PATCH] Autosave: 2024-10-19 10:00:02 --- zk/Algorithmic_complexity.md | 2 ++ zk/Function_overloads.md | 2 +- zk/Rules_for_operations_on_like_and_unlike_terms.md | 2 ++ zk/Shell_sessions.md | 2 ++ zk/Single_file_Python_scripts.md | 2 +- zk/Solving_equations.md | 6 ++++-- zk/The_History_of_Computing_Swade.md | 2 ++ zk/The_Little_Man_computer.md | 10 +++++----- 8 files changed, 19 insertions(+), 9 deletions(-) diff --git a/zk/Algorithmic_complexity.md b/zk/Algorithmic_complexity.md index 85d7dcd..80b3550 100644 --- a/zk/Algorithmic_complexity.md +++ b/zk/Algorithmic_complexity.md @@ -2,6 +2,8 @@ tags: [algorithms] --- +# Algorithmic complexity + ![Screenshot_2021-05-11_at_18.55.23.png](Screenshot_2021-05-11_at_18.55.23.png) _Summary of the main classes of algorithmic complexity_ diff --git a/zk/Function_overloads.md b/zk/Function_overloads.md index 5520f95..b0c668f 100644 --- a/zk/Function_overloads.md +++ b/zk/Function_overloads.md @@ -3,7 +3,7 @@ tags: - typescript --- -## Function overloads +# Function overloads Function overloading is not a feature of JavaScript but something close to it can be achieved with TypeScript. It proceeds by defining multiple function types diff --git a/zk/Rules_for_operations_on_like_and_unlike_terms.md b/zk/Rules_for_operations_on_like_and_unlike_terms.md index 796d6a8..f7f3a41 100644 --- a/zk/Rules_for_operations_on_like_and_unlike_terms.md +++ b/zk/Rules_for_operations_on_like_and_unlike_terms.md @@ -3,6 +3,8 @@ tags: - prealgebra --- +# Rules for operations on like and unlike terms + ## Addition ### Like terms diff --git a/zk/Shell_sessions.md b/zk/Shell_sessions.md index 30bf99f..b766db3 100644 --- a/zk/Shell_sessions.md +++ b/zk/Shell_sessions.md @@ -3,6 +3,8 @@ tags: - shell --- +# Shell sessions + ## **Types of shell session** Shell sessions can be one of or several instances of the following types: diff --git a/zk/Single_file_Python_scripts.md b/zk/Single_file_Python_scripts.md index a03702a..6b9e6d8 100644 --- a/zk/Single_file_Python_scripts.md +++ b/zk/Single_file_Python_scripts.md @@ -4,7 +4,7 @@ tags: [] created: Friday, April 26, 2024 --- -# Single_file_Python_scripts +# Single file Python scripts ## Basic architecture diff --git a/zk/Solving_equations.md b/zk/Solving_equations.md index d9234a6..da60aaf 100644 --- a/zk/Solving_equations.md +++ b/zk/Solving_equations.md @@ -2,11 +2,13 @@ tags: [algebra] --- +# Solving equations + ## Use inversion of operators When solving equations we frequently make use of the -[ operator inversion rules](Inversion%20of%20operators.md) to find -the solutions. +[ operator inversion rules](Inversion%20of%20operators.md) to find the +solutions. ### Example: inversion of addition diff --git a/zk/The_History_of_Computing_Swade.md b/zk/The_History_of_Computing_Swade.md index 93b40fd..957f2b6 100644 --- a/zk/The_History_of_Computing_Swade.md +++ b/zk/The_History_of_Computing_Swade.md @@ -3,6 +3,8 @@ tags: [literature, computer-history] created: Friday, August 23, 2024 --- +# History of Computing (Swade, 2022 ) + | Title | Author | Publication date | Resource type | | --------------------------------------------------- | ----------- | ---------------- | ------------- | | The History of Computing: A Very Short Introduction | Doron Swade | 2022 | Book | diff --git a/zk/The_Little_Man_computer.md b/zk/The_Little_Man_computer.md index 74cec1e..8f407d7 100644 --- a/zk/The_Little_Man_computer.md +++ b/zk/The_Little_Man_computer.md @@ -2,12 +2,12 @@ tags: [CPU] --- -## The Little Man Computer +# The Little Man Computer -The [Little Man Computer]() is a simplified -computer that works on Von Neuman principles. It has all the CPU components we -have detailed above. It is programmed in machine code but for simplicity it uses -the denary rather than the binary number system. +The [Little Man Computer]() is a simplified computer that works on Von Neuman +principles. It has all the CPU components we have detailed above. It is +programmed in machine code but for simplicity it uses the denary rather than the +binary number system. ![LMC_5.gif](LMC_5.gif)