diff --git a/.zk/notebook.db b/.zk/notebook.db
index 1525863..173f4e9 100644
Binary files a/.zk/notebook.db and b/.zk/notebook.db differ
diff --git a/zk/The_History_of_Computing_Swade.md b/zk/The_History_of_Computing_Swade.md
index eff91c1..8b45a0d 100644
--- a/zk/The_History_of_Computing_Swade.md
+++ b/zk/The_History_of_Computing_Swade.md
@@ -313,11 +313,11 @@ It's design was very influential because it was made public and not classified.
 ### EDVAC (1944-49) John Mauchly/J.P Eckert/ John von Neumann
 
 Built at the Moore School for the BRL as a successor to ENIAC by Mauchly and
-Eckert whilst ENIAC was still operational. It arose out of #vonNeumann
-discussions with Mauchly and Eckert and was necessitated by the need to
-calculate the behaviour of the fissile materials in the atomic bomb.
+Eckert whilst ENIAC was still operational. It's architecture arose out of
+discussions between #vonNeumann and Mauchly and Eckert and was necessitated by
+the need to calculate the behaviour of the fissile materials in the atomic bomb.
 
-It resulted in the famous _First Draft of a Report on the Edvac_ by #vonNeumann
+It resulted in the famous _First Draft of a Report on the EDVAC_ by #vonNeumann
 which is seen as the definitive statement of the modern **digital programmable
 general-purpose computer**.
 
@@ -331,4 +331,11 @@ the ABC to make ENIAC.
 
 // Add more on the hardware.
 
+### Concept of the _internal stored program_
+
+- Key innovation of the EDVAC was the _internal stored program_.
+- Solution to the problem of preceding computers requiring down-time when
+  switching between applications and problem sets.
+  - Circuitry would need to be reconfigured before the c
+
 ## Machines
diff --git a/zk/Turing_completeness.md b/zk/Turing_completeness.md
index 6179cec..e3b3b33 100644
--- a/zk/Turing_completeness.md
+++ b/zk/Turing_completeness.md
@@ -27,6 +27,11 @@ however the inverse doesn't hold: a non-TC system cannot emulate a TS system.
 For instance a calculator cannot do what a TC smart phone can do. But a smart
 phone can act as a calculator.
 
+This concept of completeness is also expressed in terms of a Universal Turing
+Machine - a TM capable of simulating any other Turing machine. Given that the
+ability of a TM to simulate another TM is the condition for completeness, a TC
+system is also a UTM.
+
 Completeness applies to the hardware of computers as well as their software.
 
 Turing Completeness is the theoretical basis of the practical concept of a
@@ -35,5 +40,3 @@ TC - it can in theory compute anything that is computable.
 
 Most modern programming languages are Turing Complete in that they can, in
 theory, be used to compute anything that is computable.
-
-What about Universal Turing Machines eh?