Elsevier

Theoretical Computer Science

Volume 168, Issue 2, 20 November 1996, Pages 257-266
Theoretical Computer Science

On machines, universal by extensions

https://doi.org/10.1016/S0304-3975(96)00079-5Get rights and content
Under an Elsevier user license
open archive

Abstract

A new definition of universal Turing machines is introduced which allows to obtain universal Turing machines with a very small number of program instructions. Here such a program with only seventeen instructions is supplied.

Cited by (0)