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

Added Title

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

College

College of Computer Studies

Department/Unit

Computer Technology

Document Type

Archival Material/Manuscript

Publication Date

2005

Abstract

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. Starting with a blank tape, the Busy Beaver writes a maximum number of 1s before reaching a halt state. The following values are noted: S(k) is the number of steps before the Busy Beaver comes to a halt and Σ(k) is the number of 1s that were written.

html

Disciplines

Computer Sciences | Theory and Algorithms

Note

Undated; creation date supplied

Keywords

Turing machines; Sequential machine theory

Upload File

wf_no

This document is currently not available here.

Share

COinS