PP-2011-36: Turing Machines for Dummies: why representations do matter

PP-2011-36: van Emde Boas, Peter (2011) Turing Machines for Dummies: why representations do matter. [Report]

[thumbnail of Full Text]
Text (Full Text)

Download (255kB) | Preview
[thumbnail of Abstract] Text (Abstract)

Download (748B)


Various methods exists in the literature for denoting the
configuration of a Turing Machine. A key difference is whether the
head position is indicated by some integer (mathematical
representation) or is specified by writing the machine state next to
the scanned tape symbol (intrinsic representation).

From a mathematical perspective this will make no difference. However,
since Turing Machines are primarily used for proving undecidability
and/or hardness results these representations do matter. Based on a
number of applications we show that the intrinsic representation
should be preferred.

Item Type: Report
Report Nr: PP-2011-36
Series Name: Prepublication (PP) Series
Year: 2011
Uncontrolled Keywords: Turing Machine Configurations; Master reductions
Depositing User: Peter Emde Boas
Date Deposited: 12 Oct 2016 14:37
Last Modified: 12 Oct 2016 14:37
URI: https://eprints.illc.uva.nl/id/eprint/440

Actions (login required)

View Item View Item