How to Make Zuse's Z3 a Universal Computer

@article{Rojas1998HowTM,
  title={How to Make Zuse's Z3 a Universal Computer},
  author={Ra{\'u}l Rojas},
  journal={IEEE Ann. Hist. Comput.},
  year={1998},
  volume={20},
  pages={51-54}
}
  • R. Rojas
  • Published 1 July 1998
  • Computer Science
  • IEEE Ann. Hist. Comput.
The computing machine Z3, built by Konrad Zuse between 1938 and 1941, could execute only fixed sequences of floating point arithmetical operations (addition, subtraction, multiplication, division, and square root) coded in a punched tape. An interesting question to ask, from the viewpoint of the history of computing, is whether or not these operations are sufficient for universal computation. The paper shows that, in fact, a single program loop containing these arithmetical instructions can… 
Unwinding performance and power on Colossus, an unconventional computer
  • B. Wells
  • Computer Science
    Natural Computing
  • 2010
TLDR
It is seen that a UTM could have been implemented on a clustering of the ten Colossus machines installed at Bletchley Park, England, by the end of WWII in 1945, and several advances in input, output, speed, processing, and applications are offered.
The Architecture of Konrad Zuse’s Z4 Computer
  • Raúl Rojas
  • Computer Science
    2021 7th IEEE History of Electrotechnology Conference (HISTELCON)
  • 2021
TLDR
The programming architecture of Konrad Zuse’s Z4 computer is described, which was the successor to the Z3 machine completed in 1941 and assembled over the next four years, until German capitulation.
History ) – Assignment 2 On Konrad Zuse ’ s Developments
TLDR
This essay describes the development of a machine that could perform complex, schematic calculations automatically and that was adapted to the particular needs of engineers and scientists by Konrad Zuse between 1936 and 1945.
Babbage Meets Zuse: A Minimal Mechanical Computer
TLDR
This paper shows how to build a computer consisting of a few mechanical elements, using Charles Babbage's gears and wooden pegs with Konrad Zuse's idea.
Stored program concept
The key design feature of modern computers, which allows the instructions to be held in the internal store while they are awaiting execution, is known as the stored program concept. Many computers,
The Dawn of Software Engineering: From Turing to Dijkstra
TLDR
The Dawn of Software Engineering: from Turing to Dijkstra, Edgar G. Daylight deromanticizes Turing's & logic's role in the history of computing and vividly describes how & why DijkStra's ideas stood out among those of his contemporaries.
STEROIDS for DOPed Applications: A Compiler for Automated Data-Oriented Programming
TLDR
Novel techniques to automate the process of generating DOP exploits are presented and a compiler called STEROIDS is implemented that leverages these techniques and compiles the authors' high-level language SLANG into low-level DOP data structures driving malicious computations at run time, enabling highly expressive attacks without conventional code-injection or code-reuse techniques in applications lacking a scripting engine.
Memory Efficient Hard Real-Time Garbage Collection
TLDR
This thesis presents a predictable garbage collection method, real-time reference counting, that increases memory efficiency by about 50 % compared to the most memory efficient previously presented predictable garbage collector.
Approaching overhead-free execution on FPGA soft-processors
TLDR
This work presents an improved FPGA soft-processor architecture which statically overlaps "overhead" computations and executes them in parallel with the "useful" Computations, significantly reducing the number of processor cycles needed to execute sequential programs, while reducing maximum clock frequency to 0.939x of its original value.
Turing in Context—Response
TLDR
In 1936, Turing successfully addressed Hilbert's question of decidability, a problem that Godel's work had not settled, and he did so based on an argument based on Hilbert's work.
...
...

References

SHOWING 1-7 OF 7 REFERENCES
Conditional Branching Is Not Necessary for Universal Computation in Von Neumann Computers
TLDR
It is proved that, surprisingly, conditional branching can be substituted by unconditional branching and any computable function can be computed using only the instructions LOAD, STORE, INC and GOTO unconditional branching.
Konrad Zuse's Legacy: The Architecture of the Z1 and Z3
  • Raúl Rojas
  • Materials Science
    IEEE Ann. Hist. Comput.
  • 1997
TLDR
It is argued that both the Z1 and the Z3 possessed features akin to those of modern computers: the memory and processor were separate units, and the processor could handle floating-point numbers and compute the four basic arithmetical operations as well as the square root of a number.
On the Control Power of Integer Division
On folk theorems
TLDR
This paper shall attempt to provide a reasonable definition of or, rather, criteria fbr ~btk theorems, followed by a detailed example illustrating the ideas, and take a piece of ~blklore and show it is a theorem, or take a theorem and show that it is ff~lklore.
Die Rechenmaschinen von Konrad Zuse
On the Control Power ofInteger Division
  • Theoretical Computer Science,
  • 1983