diff --git a/tech/AI.wiki b/tech/AI.wiki
index 0c89ce3..51514b0 100644
--- a/tech/AI.wiki
+++ b/tech/AI.wiki
@@ -5,11 +5,16 @@ AI or artifical intelligence is the art of making intelligent machines.
 == Goals ==
 
 * Expert systems
-  * exhibit itlligent behaviours
+  * exhibit itlligent behaviours in one field, (IE chess AIs beat humans)
 * Human intelligence
   * behave, think, and learn like humans
 
 == Types ==
 
+* AI
+  * Machines which mimic human behaviour
+  * not even close as of currently
 * [[machine_learning]]
-* [[neural]]
+  * Allow machines to find statistical relationships in data to mimic patterns
+* Deep learning
+
diff --git a/tech/Dijkstra.wiki b/tech/Dijkstra.wiki
index 4daac71..b07078c 100644
--- a/tech/Dijkstra.wiki
+++ b/tech/Dijkstra.wiki
@@ -5,7 +5,7 @@ for finding the *shortest path between any two nodes in a graph*. This can be
 thought of finding the best route from point A to point B on something like a
 road map. This is also called a *routing protocol*.
 
-Dijkstra's Algorithm is a [[greedy_algorithm]]. 
+Dijkstra's Algorithm is a [[greedy_algorithm]].
 
 == Algorithm ==
 
@@ -20,9 +20,9 @@ Dijkstra's Algorithm is a [[greedy_algorithm]].
      N1's distance is 6+2 = 8. If the node was previously marked as having a
      different value, keep the smallest of the two values.
 4) Once we have checked all of a nodes neighbors, remove it from the unvisited
-   set. A visited node is never checked again. 
+   set. A visited node is never checked again.
 5) If searching for a specific node, the algorithm can stop when the desired
-   node is no longer in the 'unvisted' set. 
+   node is no longer in the 'unvisted' set.
 6) If not, select the unvisted node with the smalled distance, and set it as
    the current node, and go back to step 3