Two symbol finite state machines: The busy beaver: A k-state, 2-symbol Turing machine

• Main Author: Pedro, Ana Marian M.
• Format: text
• Published: Animo Repository 2005
• Subjects: Turing machines; Sequential machine theory; Computer Sciences; Theory and Algorithms
• Online Access: https://animorepository.dlsu.edu.ph/faculty_research/10912
• Institution: De La Salle University

A discussion on the k-state, 2-symbol Turing Machine known as the Busy Beaver. It consists of a two-way infinite tape on which two symbols {0, 1} are written. A tape head can read or write these symbols into the tape one at a time depending on an operation determined by a set of instructions. Starti...