Search
Skip to Search Results
Filter
Subject / Keyword
Author / Creator / Contributor
Year
Collections
Languages
Item type
-
1997
Technical report TR97-02. It is shown that the popular puzzle Sokoban can be used to emulate a linear bounded automata (finite tape Turing Machine (TM)). In particular, a construction is given that has a solution if and only if the corresponding Turing Machine on its input halts in the accept...
1 - 1 of 1