notes

commit 6bc2444cc13906cee7dfa97f9480b79c6c4c61b8
parent 8e8ec807bc9ad2e60824e60d33cf91eaafd51b95
Author: Andrew <andrewlaack1@gmail.com>
Date:   Wed, 23 Oct 2024 11:53:04 -0500

Took notes on discrete

Diffstat:
A
AISafety.md
 | 
36
++++++++++++++++++++++++++++++++++++
M
Digraph.md
 | 
2
++
M
DiscreteMath.md
 | 
10
+++++++---
M
MachineLearning.md
 | 
2
+-
A
ZeroOneMatrix.md
 | 
10
++++++++++
M
index.md
 | 
1
+

6 files changed, 57 insertions(+), 4 deletions(-)
diff --git a/AISafety.md b/AISafety.md
@@ -0,0 +1,36 @@
+:safety: :index: :ai:
+
+Links to AI Safety Notes
+
+## Questions To Answer
+
+What problems are falsifiable and consequently worth working on?
+
+Is destruction of lower beings a convergent goal?
+
+How might we solve the stop button paradox?
+
+How to define AGI?
+
+How to test for AGI?
+
+## Notes
+
+#### Things to Read
+
+* Vernor Vinge’s seminal essay
+
+
+
+
+
+#### Superintelligence - Nick Bostrom
+
+Ch. 1
+* Singularity
+* IntelligenceExplosion
+* Prognosticator
+* OptimalBayesianAgent
+* FlashCrash - Real world example of mis-specified utility function causing consequences
+* StrongAI
+* WeakAI
diff --git a/Digraph.md b/Digraph.md
@@ -6,3 +6,5 @@ Ch 4
 ## Notes
 
 **Definition:** A digraph is a directed graph meaning each edge has only one direction in which traversal is possible.
+
+When discussing digraphs, the start of an edge is called the initial vertex and the end is called the terminal vertex.
diff --git a/DiscreteMath.md b/DiscreteMath.md
@@ -164,6 +164,10 @@ Unit 9.1 (Relations)
 	- [Transitive](Transitive.md)
 
 Unit 9.3 (Representing Relations)
-	- ZeroOneMatrix
-	- Digraph (initial and terminal for vertex names w/ respect to edges)
-	- Loop
+	- [ZeroOneMatrix](ZeroOneMatrix.md)
+	- [Digraph](Digraph.md) (initial and terminal for vertex names w/ respect to edges)
+	- [Loop](Loop.md)
+
+Unit 9.4 (Closures of Relations)
+	- TransitiveClosure
+	- Closure
diff --git a/MachineLearning.md b/MachineLearning.md
@@ -1,4 +1,4 @@
-:ml:
+:ml: :index:
 # Machine Learning
 
 Links to ML Notes
diff --git a/ZeroOneMatrix.md b/ZeroOneMatrix.md
@@ -0,0 +1,10 @@
+:discrete: :graphs: 
+# Zero-one Matrix
+
+Ch 9.3
+
+## Notes
+
+**Definition:** A zero one matrix is a boolean matrix where each index is either 0 or 1.
+
+When multiplying boolean matricies we can either do matrix multiplication and assume anything non-zero is one or we can do or comparisons (more inline with the philosophy of zero one matricies).
diff --git a/index.md b/index.md
@@ -18,6 +18,7 @@ This is the index for my main note classifications. I will maintain this as a ho
 
 [[ComputerArchitecture.md]]
 [[MachineLearning.md]]
+[[AISafety.md]]
 [[StatisticsAndProbability.md]]
 [[LinuxStuff.md]]
 [[LinearAlgebra.md]]