|
|
Posted by CoreyWhite on 02/20/07 13:51
Here is the algorithm I am planning.
1) Sort all of the words in the old testament alphabetically.
2) Sort all of the words in the new testament alphabetically
backwards.
3)Use the two new books as consistent keys to unlock the third book,
which is complete but inconsistent.
4) We create a fourth book that references the first 3, and looks at
the first 2 ordered, alphabetic sets, as being mathematically
consistent, and looks at the third book as being a complete set of the
other two books.
So because the fourth book keeps everything together in an object
oriented set by itself, it can be complete and consistent without
letting the objects it contains contradict themselves.
Navigation:
[Reply to this message]
|