The only objective way to provide evidence for the Torah code hypothesis is for experiments associating Torah code tables with historical events to be unusually compact. Unusually compact means that the probability that a table as compact would arise from a randomly sampled text in a monkey text population is sufficiently small. Such tables, by immediate implication from its probability definition, arise very infrequently by chance. Critics have argued directly or indirectly that they are easy to generate. Therefore our challenge made today, February 11, 2009.
If you think that tables as compact as those arising from the Torah text and appearing on this website occur frequently, we give you this challenge. Try to create one. If you can, we will give you a monetary prize and recognition. Here are the rules:
- Pick an historical event
- In an a priori manner, select key words for the historical event using the WHO WHAT WHERE DATE YEAR and HOW event categories. ( See here for a detailed description of these event categories) There must be a total of at least 5 key words, each three or more letters, and no more than one from each of the event categories. If a key word is three letters it must have one of the infrequently occuring letters Tet or Gimmel. You must use key words from newspaper articles on the selected historical topic available on the internet.
- Select in an a priori manner a text (in any language) whose digital format is available as a download on the internet
- Translate your key words into the same language as the text
- Using your selected text, use whatever commercially developed software you like, or your own software, to find the best table you can find having one ELS of each of your key words. Keep track of how you interactively found the table.
- Submit by email to Webmaster.
- the list of a priori key words and digital copies of the newspaper articles containing them
- the a priori selected text and the URL from where it can be downloaded
- a pdf, jpg or png file of the most compact table you can find having one ELS for each of the selected key words
- a small report describing what software you used and how you interactively found the submitted table and the number of historical events you tried before the one you used in your submission
- a payment of $10 made to haralick@netscape.net through paypal
- your name and address
- an email indicating your permission for us to put your table in the CHALLENGE section of our website
For the probability to have the meaning given above, the key words used in the experiment must be selected a priori. The a priori experimental protocol governing how the experiment is actually performed will be that used for the tables on our website.
We will check your key words to see if your a priori claim is reasonable based on the newpaper articles you submitted. If so, we will run the Monte Carlo experiment to determine the probability that a text from the ELS random placement text population would produce a table as compact as you found. If this probability is smaller than 1/1000, we will recognize your efforts and put your table in the prize winning category of the CHALLENGE section of our website and if you are one of the first two winning entries, we will mail to you a cash prize of $100. If the probability is larger than 1/1000, we will put your table in the losing category of the CHALLENGE section of our website and you will get our thanks for participating and recognition for at least trying.
As of today nobody has tried the challenge. As soon as somebody has we will provide a webpage for the submitted table and our analysis of it with our Monte Carlo experiment results.
Website content by: Professor Robert M. Haralick