Building a Universal Machine
Minimum price
Suggested price

Building a Universal Machine

A Hands-on Introduction to Computability

About the Book

A comprehensive, step-by-step guide to unraveling the intricacies of computer functionality, tracing its evolution from ancient logic to electronic circuits. This book is supposed to be engaging, with an emphasis on practical applications rather than dry mathematical concepts.

The hands-on approach ensures that readers grasp the fundamentals as they embark on the task of building a universal computer in JavaScript using only previously learned elements.

About the Author

Tomas Tulka
Tomas Tulka

is keen on building small machines

Table of Contents

  • About the BookI.Welcome to the Machine
    • 1.In Pursuit of Mechanical Thought
      • Logic
      • Metamathematics
      • Incompleteness
      • Entscheidungsproblem
      • Church–Turing Thesis
      • Timeline
    • 2.Everything Is a Number
      • Numeral Systems
      • Sets
      • Numbers
    II.Abstract Machines
    • 3.Simple Machines
      • Finite Automata
        • Nondeterministic Finite Automata
        • Regular Languages and Expressions
      • Pushdown Automata
        • Nondeterministic Pushdown Automata
        • Probabilistic Automata
        • Context-Free Languages
      • Linear Bounded Automata
        • Context-Sensitive Languages
    • 4.Universal Machines
      • Turing Machines
        • Decidable Languages
        • Subroutines
        • Multitape
        • Fixed-End Tape
        • Nondeterministic Machines
        • Restricted Alphabet
      • Universal Turing Machines
        • Input Encoding
        • Virtual Tapes
        • Design
        • Implementation
        • Testing
        • Programming
        • Rrr
        • Self-Interpreter
      • The Halting Problem
        • Semi-Decidable Languages
    • 5.Number Machines
      • Register Machines
        • Counter Machines
        • Random-Access Machines
        • Stored-Program Machines
        • Universal Register Machine
      • Recursive Functions
        • Primitive recursion
        • Partial Recursion
        • Universal Recursive Function
        • Simulating Recursive Functions
    • 6.Programming Machines
      • Turing Completeness
      • Structured Programming
    • 7.Small Machines
      • Minimal-State Turing Machines
        • Wolfram 2,3
      • Lambda Calculus
        • Non-Halting Lambda Functions
        • Syntactic Sugar
        • Numbers
        • Functional Programming
        • Combinatory Logic
      • Tag Systems
        • Universal Tag Systems
        • Cyclic Tag Systems
      • Cellular Automata
        • The Game of Life
        • Universal Cells
        • Rules
      • One-Instruction Set Computers
    • 8.Hyper Machines
      • Quantum Computers
      • Super-Recursive Algorithms
      • Oracles
      • Inductive Turing Machines
      • Exotic Machines
    III.Actual Machines
    • 9.Mechanical Machines
      • Ancient Devices
      • Medieval Inventions
      • First Reckoners
        • Pascaline
        • Leibniz calculator
        • Jacquard Loom
      • Early Computers
        • Analytical Engine
        • Z3
        • Mark I
        • ENIAC
        • EDVAC
    • 10.Logic Machines
      • Logic Gates
        • NOT Gate
        • AND Gate
        • OR Gates
        • XOR Gate
        • NOR Gate
        • NAND Gate
      • Logic Circuits
        • Arithmetics
        • Multiplexers
        • Storages
    • 11.Electronic Machines
      • Integrated Circuits
      • Transistors
    • 12.Computer Machines
      • Clock
      • Cache
      • Memory
      • Universal Computer
        • Processor
    IV.Goodbye, Machine
    • 13.Mind Machines
      • Universality
      • Computing the Universe
      • Machines Like Us
      • In Summary
    • Appendix
      • Examples of Turing Machines
        • Copier
        • Palindromes
        • Hello World
      • Universal Turing Machine
      • Structured Universal Machine
      • Structured Universal Machine (Extended)
      • Universal Minsky Machine
      • Universal Recursive Function in JavaScript
      • Universal Tag System
      • Lambda Calculus Generic Recursion
    • References

The Leanpub 60 Day 100% Happiness Guarantee

Within 60 days of purchase you can get a 100% refund on any Leanpub purchase, in two clicks.

Now, this is technically risky for us, since you'll have the book or course files either way. But we're so confident in our products and services, and in our authors and readers, that we're happy to offer a full money back guarantee for everything we sell.

You can only find out how good something is by trying it, and because of our 100% money back guarantee there's literally no risk to do so!

So, there's no reason not to click the Add to Cart button, is there?

See full terms...

80% Royalties. Earn $16 on a $20 book.

We pay 80% royalties. That's not a typo: you earn $16 on a $20 sale. If we sell 5000 non-refunded copies of your book or course for $20, you'll earn $80,000.

(Yes, some authors have already earned much more than that on Leanpub.)

In fact, authors have earnedover $13 millionwriting, publishing and selling on Leanpub.

Learn more about writing on Leanpub

Free Updates. DRM Free.

If you buy a Leanpub book, you get free updates for as long as the author updates the book! Many authors use Leanpub to publish their books in-progress, while they are writing them. All readers get free updates, regardless of when they bought the book or how much they paid (including free).

Most Leanpub books are available in PDF (for computers) and EPUB (for phones, tablets and Kindle). The formats that a book includes are shown at the top right corner of this page.

Finally, Leanpub books don't have any DRM copy-protection nonsense, so you can easily read them on any supported device.

Learn more about Leanpub's ebook formats and where to read them

Write and Publish on Leanpub

You can use Leanpub to easily write, publish and sell in-progress and completed ebooks and online courses!

Leanpub is a powerful platform for serious authors, combining a simple, elegant writing and publishing workflow with a store focused on selling in-progress ebooks.

Leanpub is a magical typewriter for authors: just write in plain text, and to publish your ebook, just click a button. (Or, if you are producing your ebook your own way, you can even upload your own PDF and/or EPUB files and then publish with one click!) It really is that easy.

Learn more about writing on Leanpub