It might be difficult to find a copy of this, but it's worth the effort. His explanation of the un-solvability of the word equivalence problem is an intriguing glimpse into the limits of algorithms.
The illustration on the cover is the diagram of a game where the play has 4 choices. 3 of those choices lead to a loss (represented by a minus sign) and 1 leads to a win (represented by a plus sign).
No comments:
Post a Comment