|
Posted by Dennis M. Hammes on 02/21/07 09:03
CoreyWhite wrote:
> On Feb 20, 12:41 pm, "davidsa...@yahoo.com" <davidsa...@yahoo.com>
> wrote:
>
>>On Feb 20, 9:51 pm, "CoreyWhite" <CoreyWh...@gmail.com> wrote:
>>
>>
>>
>>
>>>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.
>>
>>Capitalize!
>>
>>>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.
>>
>>Nice to know insanity is alive and well in the Christian faith.
>
>
>
> I've rethought the design again.
> I would just need to keep two sorted lists. One list being the
> alphabetized list of words in the bible, and the other list being the
> ordered placement of each coresponding word in the first list. So
> that when you combine the two consistent lists by reording the first
> list acording to the second; you get the origonal bible.
>
OOOooo... James Strong /lives/!
--
-------(m+
~/:o)_|
I do not "negotiate" for half my baby back, Solomon.
http://scrawlmark.org
Navigation:
[Reply to this message]
|