commit 0e49800914d94add1757ca6f7a88a429710a1a2f
parent dd366547e4c0bf5d0a35fc7573b2ea01fb94baa2
Author: Andrew <andrewlaack1@gmail.com>
Date: Wed, 11 Sep 2024 05:43:04 -0500
Took assembly notes
Diffstat:
11 files changed, 94 insertions(+), 5 deletions(-)
diff --git a/Algorithms.md b/Algorithms.md
@@ -73,3 +73,9 @@ L6:
- [[AsymptoticNotation.md]]
- [[Trichotomy.md]]
- [[MonotonicFunction.md]]
+
+
+#### Other algorithms adjacent stuff
+
+- [BekensteinBound](BekensteinBound.md)
+- [OracleComputer](OracleComputer.md)
diff --git a/Ascii.md b/Ascii.md
@@ -0,0 +1,8 @@
+:cs:
+# Ascii
+
+W2
+
+## Notes
+
+**Definition:** Ascii is another character encoding scheme that uses only 1 byte per character.
diff --git a/Assembly.md b/Assembly.md
@@ -17,8 +17,8 @@ Week 1:
Week 2:
-- Unicode (2 bytes)
-- Ascii (1 byte)
-- String (zero terminated, this is the c standard but we will use it in assembly)
-- Microprocessor (core / no memory in processor)
-- Microcontroller (core + memory / the memory is with the core but can work with external memory)
+- [Unicode](Unicode.md)
+- [Ascii](Ascii.md)
+- [String](String.md) (zero terminated, this is the c standard but we will use it in assembly)
+- [Microprocessor](Microprocessor.md)
+- [Microcontroller](Microcontroller.md)
diff --git a/BekensteinBound.md b/BekensteinBound.md
@@ -0,0 +1,10 @@
+:computation: :physics:
+# Bekenstein Bound
+
+SS
+
+## Notes
+
+**Definition:** The Bekenstein bound gives the most amount of energy that can be contained in a sphere prior to it becoming a blackhole.
+
+This has implications for computation as there is a theoretical cap for which any computation device that exceeds this would instantly become a blackhole.
diff --git a/DiscreteMath.md b/DiscreteMath.md
@@ -122,3 +122,12 @@ Unit 6.2 (Pigeonhole principle)
- [PigeonholePrinciple](PigeonholePrinciple.md)
- [GeneralizedPigeonholePrinciple](GeneralizedPigeonholePrinciple.md)
- [Subsequence](Subsequence.md)
+ - [RamseyNumbers](RamseyNumbers.md)
+
+Questions:
+
+Ask about the generalized php problem where we find that in a month of 30 days if the team plays at least one game per day and less than 45 games there is at least one sequence a_i through a_j such that a_j - a_i = 14.
+
+Is there a genralizable process to make determinations about sequences with php?
+
+I am confused about ramsey numbers. Is there a visualization for them or another way to state the idea?
diff --git a/Microcontroller.md b/Microcontroller.md
@@ -0,0 +1,10 @@
+:cs: :assembly:
+# Microcontroller
+
+W2
+
+## Notes
+
+**Definition:** A microcontroller consists of a cpu, integrated memory, and the ability to use external memory.
+
+A microcontroller is a fully functional computer whereas a [Microprocessor](Microprocessor.md) is simply the CPU.
diff --git a/Microprocessor.md b/Microprocessor.md
@@ -0,0 +1,10 @@
+:cs: :assembly:
+# Microprocessor
+
+W2
+
+## Notes
+
+**Definition:** A microprocessor is simply a processor by itself.
+
+This does not include memory or anything else with it.
diff --git a/OracleComputer.md b/OracleComputer.md
@@ -0,0 +1,10 @@
+:computation:
+# Oracle Computer (machine)
+
+SS
+
+## Notes
+
+**Definition:** An oracle computer is a computer that can compute any computable problem.
+
+Such a system does not need to be possible see [BekensteinBound](BekensteinBound.md) for why it may not be possible.
diff --git a/RamseyNumbers.md b/RamseyNumbers.md
@@ -0,0 +1,8 @@
+:discrete:
+# Ramsey Number
+
+Ch 6.2
+
+## Notes
+
+**Definition:** A Ramsey number R(m,n) where m,n are natural numbers and n is greater than or equal to 2, is the minimum number of people at a party such that there are either m mutual friends or n mutual enemies.
diff --git a/String.md b/String.md
@@ -0,0 +1,10 @@
+:cs:
+# String
+
+W2
+
+## Notes
+
+**Definition:** A string is a collection of ordered characters.
+
+C style strings are strings that contain n+1 indeces where the n+1th byte is all zeroes.
diff --git a/Unicode.md b/Unicode.md
@@ -0,0 +1,8 @@
+:assembly: :cs:
+# Unicode
+
+W2
+
+## Notes
+
+**Definition:** Unicode is a character encoding systems that uses two bytes to represent almost all characters across languages.
