Algorithmic Permutation of part of the Torah

Details Algorithmic Permutation of part of the Torah Algorithmic Permutation of part of the Torah

2007-12-17

arxiv.org/abs/0712.2606v3

Proc. ANPA 27, Wesley College, Cambridge, UK, September 2005

Computer Science

Cryptography and Security

10 Pages. Presented at the Second Conference of the International Torah Codes Society, Jerusalem, Israel, 6th June 2000. Minor

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Algorithmic Permutation of part of the Torah does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic Permutation of part of the Torah, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic Permutation of part of the Torah will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115610