loading page

Memory machine: A practical Turing machine for computation and quotation
  • C. Bradford Barber
C. Bradford Barber
no affiliation

Corresponding Author:[email protected]

Author Profile

Abstract

This paper transforms the Turing machine into von Neumann’s modern code paradigm. Values are unordered identifiers. The operations assign-value and equals-value are computer hardware instructions. Its programs have dual numeric and natural language representations. The same representation supports a thesaurus of quotations that capture ideas. Appendices provide a program for the universal Turing machine, a specification of numeric identifiers from 2 bytes to 80 bytes, and a specification of 64-bit disk block identifiers from 64 bytes to 64 megabytes. Numeric identifiers may include a timestamp and SHA-1 revision. Disk blocks are self-identifying. Aims and Scope This paper is a research article that presents a new foundation for computer software. The definition of memory machine is complete. The implementation of memory machines (Avev and Thesa) is a work in progress. Thesa (silent ‘h’) contains quotations relevant to Avev and Thesa development. For example, Thesa includes many references from Software: Practice and Experience. Avev is currently a primitive language. It will eventually include the features of programming languages. The Echonet prototype for Avev is a demonstration of what can be done. The readership is anyone interested in new approaches to computer programming. The Byte article on Echonet was well received.