Conditional Branching is Not Necessary

Four simple instructions are sufficient to evaluate any Turing computable function using self-modifying programs: LOAD, STORE, GOTO, INCREment.

Further Reading:

Raul Rojas / Conditional Branching is Not Necessary for Universal Computation in von Neuman Computers, Journal of Universal Computer Science 2,11 (1996) 756-768

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.101.757&rep=rep1&type=pdf

William F. Gilreath, Phillip A. Laplante / Computer Architecture: A Minimalist Perspective

[*11.65]

<>

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.