Bit Copying - The Ultimate Computational Simplicity

TL;DR

This paper introduces a minimalistic computational model based solely on referencing and bit copying, demonstrating that complex computation can be achieved without traditional logic operations, and providing a Turing-complete language implementation.

Contribution

It presents a novel, simple computational framework using only referencing and bit copying, expanding understanding of computational universality with minimal primitives.

Findings

The model is Turing-complete using only two operations.

A compiler and emulator for the language are publicly available.

Sample programs demonstrate practical applicability.

Abstract

A computational abstract machine based on two operations: referencing and bit copying is presented. These operations are sufficient for carrying out any computation. They can be used as the primitives for a Turing-complete programming language. The interesting point is that the computation can be done without logic operations such as AND or OR. The compiler and emulator of this language with sample programs are available on the Internet.