thomasabishop/eolas
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Autosave: 2024-09-16 19:00:03

Browse source
This commit is contained in:
thomasabishop 2024-09-16 19:00:03 +01:00
parent 054ee22cbf
commit 5968aafb24
3 changed files with 16 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

BIN
.zk/notebook.db
View file

Binary file not shown.

15
zk/The_History_of_Computing_Swade.md
View file

@ -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

7
zk/Turing_completeness.md
View file

@ -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?