On Formalisms for Turing Machines

The Solvability of the Halting Problem for 2-State Post Machines

Journal of the ACM (JACM)

Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science

Communications of the ACM

Simulation of one abstract computing machine by another

Communications of the ACM

Multi-tape and infinite-state automata—a survey

Communications of the ACM

A simple hardware model of a Turing machine: its educational use

ACM '72 Proceedings of the ACM annual conference - Volume 1

Theory of computing in computer science education

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference

The complexity of small universal Turing machines: A survey

Theoretical Computer Science

The reduction of tape reversals for off-line one-tape Turing machines

Journal of Computer and System Sciences

Multitape one-way nonwriting automata

Journal of Computer and System Sciences

The complexity of small universal turing machines: a survey

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Towards methods for discovering universal Turing machines (or how universal unicorns can be discovered, not created)

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119