Claude E. Shannon
Abstract
This chapter contains sections titled:IntroductionThe two-State Universal Turing MachineImpossibility of a One-State Universal Turing MachineModeling a Turing Machine with Only Two Tape Symbols
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This chapter contains sections titled:IntroductionThe two-State Universal Turing MachineImpossibility of a One-State Universal Turing MachineModeling a Turing Machine with Only Two Tape Symbols
Key concepts: Turing machine examples, Universal Turing machine, Turing machine, Non-deterministic Turing machine, Probabilistic Turing machine, Impossibility, NSPACE, Description number