In this paper we describe a Torah Code experiment which: focuses on a famous contemporary event, has a simple and explicit data collection, and has considerably simpler measurements than in previous Torah Code experiments. The pattern we study here is a cluster of related key words in the form of ELSs in a single table. The cluster that we discover contains a subset of all key words obtained in the data collection. We account for the choices needed to determine this subset using the Bonferroni inequality. Our protocol involves some other explicit choices, accounted for in a similar way. The final p-value is less than 5.14 times 10 -5
['Eliyahu Rips', 'Art Levitt']
The Twin Towers Cluster in Torah Codes