Algorithmic Permutation of part of the Torah
Abstract
A small part of the Torah is arranged into a two dimensional array. The characters are then permuted using a simple recursive deterministic algorithm. The various permutations are then passed through three stochastic filters and one deterministic filter to identify the permutations which most closely approximate readable Biblical Hebrew. Of the 15 Billion sequences available at the second level of recursion, 800 pass the a priori thresholds set for each filter. The resulting "Biblical Hebrew" text is available for inspection and the generation of further material continues.
Cite
@article{arxiv.0712.2606,
title = {Algorithmic Permutation of part of the Torah},
author = {Grenville J. Croll},
journal= {arXiv preprint arXiv:0712.2606},
year = {2010}
}
Comments
10 Pages. Presented at the Second Conference of the International Torah Codes Society, Jerusalem, Israel, 6th June 2000. Minor updates and added Appendix B in version 2, October 2010