Why Letter Substitution Puzzles are Not Hard to Solve: A Case Study in Entropy and Probabilistic Search-Complexity

Eric Corlett, Gerald Penn


Anthology ID:
W13-3009
Volume:
Proceedings of the 13th Meeting on the Mathematics of Language (MoL 13)
Month:
August
Year:
2013
Address:
Sofia, Bulgaria
Editors:
András Kornai, Marco Kuhlmann
Venue:
MoL
SIG:
SIGMOL
Publisher:
Association for Computational Linguistics
Note:
Pages:
83–92
Language:
URL:
https://aclanthology.org/W13-3009
DOI:
Bibkey:
Cite (ACL):
Eric Corlett and Gerald Penn. 2013. Why Letter Substitution Puzzles are Not Hard to Solve: A Case Study in Entropy and Probabilistic Search-Complexity. In Proceedings of the 13th Meeting on the Mathematics of Language (MoL 13), pages 83–92, Sofia, Bulgaria. Association for Computational Linguistics.
Cite (Informal):
Why Letter Substitution Puzzles are Not Hard to Solve: A Case Study in Entropy and Probabilistic Search-Complexity (Corlett & Penn, MoL 2013)
Copy Citation:
PDF:
https://aclanthology.org/W13-3009.pdf