Testing The Torah Code Hypothesis: The Experimental Protocol

This is the second part of a tutorial discussing the ex-perimental protocol issues in Testing the Torah Code Hy-pothesis. The principal concept is the test statistic which is used to do the actual hypothesis testing of the Null hy-pothesis against a simple alternative or against a complex of alternatives. We illustrate the methodology using the data sets from the WRR[3] experiment. We use the WRR key word sets of list 1 and 2 combined. The experiment produces a p-value of less than 1/100,000 in the Genesis text. We performed another experiment pairing rule based transliterations for the spellings of the names of the Ameri-can presidents into Hebrew with the Hebrew word for pres-ident. Taking into account Bonferroni, the resulting p-value of the 100,000 trial experiment was less than 1/66,667. 1

Basic Concepts For Testing The Torah Code Hypothesis

This is the first part of a tutorial discussing the major strategies and methodologies by which a test of the Null hy-pothesis of no Torah effect can be done. The basic concepts of equidistant letter sequence, skip specification, resonance specification, and compactness features are discussed here. 1

A SPATIAL DATA STRUCTURE

No abstract available

STRUCTURAL DESCRIPTIONS AND INEXACT MATCHING

In this paper we formally define the structural description of an object and the concepts of exact and inexact matching of two structural descriptions. We discuss the problems associated with a brute-force backtracking tree search for inexact matching and develop several different algorithms to make the tree search more efficient. We develop the formula for the expected number of nodes in the tree for backtracking alone and vith a forward checking algorithm. Finally we present experimental results verifying the theory and showing that forward checking is the most efficient of the algorithms tested