OMEGA SERVER ontology
Charles E. Matthews
ECafe Anonymous Remailer wrote:
>
> The 36e2000 OMEGA SERVER ontology contains all the text that has
> ever been written or ever will be written in the english language.
>
> - - - - -
>
> A single read/write program can uniformly generate all values for all
> coordinates in the 36e2000 page dataset:
>
> GENERATE ALL VALUES FOR ALL COORDINATES
> LINE BY LINE
> PAGE BY PAGE
> FROM A-Z
> FROM (1x,1y,1z) TO (50x,40y,36e2000z)
>
> By writing all english text in a uniform, non-random, way throughout
> the dataset, one can simply search/read the text by its position in
> the dataset (predetermined by the read/write program), without
> generating all 36e2000 pages first, then storing all 36e2000 pages,
> then searching.
>
Is this the AI equivalent of a perpetual motion machine?
Chuck
______________________________________________________________________
Charles E. Matthews
Software consulting in knowledge
Synergistic Technologies based systems and object oriented
chu...@infonet.isl.net analysis and design
ECafe Anonymous Remailer
OMEGA SERVER ontology
The endpoint of database technology
- - - - -
The english language contains 26 characters for the alphabet,
nine characters for basic punctuation, and, one character for a
spacing function.
A standard page size is 50 characters wide by 40 characters deep
or 2000 characters.
A (finite alphabet) to the power (finite page size)= finite # pages
(36) to the power (2000) = 36e2000 pages
The 36e2000 OMEGA SERVER ontology contains all the text that has
ever been written or ever will be written in the english language.
- - - - -
A single read/write program can uniformly generate all values for all
coordinates in the 36e2000 page dataset:
GENERATE ALL VALUES FOR ALL COORDINATES
LINE BY LINE
PAGE BY PAGE
FROM A-Z
FROM (1x,1y,1z) TO (50x,40y,36e2000z)
By writing all english text in a uniform, non-random, way throughout
the dataset, one can simply search/read the text by its position in
the dataset (predetermined by the read/write program), without
generating all 36e2000 pages first, then storing all 36e2000 pages,
then searching.
- - - - -
Those individuals interested in developing and testing Knowledge
Discovery and Data Mining (KDD) Algorithms utilizing the OMEGA
SERVER ontology please contact:
ECafe Anonymous Remailer
OMEGA SERVER ontology
The endpoint of database technology
- - - - -
The english language contains 26 characters for the alphabet, nine
characters for basic punctuation, and one character for a spacing
function.
A standard page size is 50 characters wide by 40 characters deep
or 2000 characters.
A (finite alphabet) to the power (finite page size)= finite # pages
(36) to the power (2000) = 36e2000 pages
The 36e2000 OMEGA SERVER ontology contains all the text that has ever
been written or ever will be written in the english language.
- - - - -
A single read/write program can uniformly generate all values
for all coordinates in the 36e2000 page dataset:
GENERATE ALL VALUES FOR ALL COORDINATES
LINE BY LINE
PAGE BY PAGE
FROM A-Z
FROM (1x,1y,1z) TO (50x,40y,36e2000z)
By writing all english text in a uniform, non-random, way throughout
the dataset, one can simply search/read the text by its position in
the dataset (predetermined by the read/write program) without
ECafe Anonymous Remailer
OMEGA SERVER ontology
The endpoint of database technology
- - - - -
The 36e2000 OMEGA SERVER ontology contains all the text that has ever
been written or ever will be written in the english language.
- - - - -
Those individuals interested in developing and testing KDD Algorithms
Randall A Helzerman
In article <1996071512...@avignon.hypereality.co.uk>, re...@remail.ecafe.org (ECafe Anonymous Remailer) writes:
|> The 36e2000 OMEGA SERVER ontology contains all the text that has ever
|> been written or ever will be written in the english language.
See "The Library of Babel" by Borges for a complete exploration of this dead
end.
|> Those individuals interested in developing and testing KDD Algorithms
|> utilizing the OMEGA SERVER ontology please contact:
Include me out.
--
Randy Helzerman
http://yara.ecn.purdue.edu/~helz/
jf...@poboxes.com
In article , "Charles says...
>
>ECafe Anonymous Remailer wrote:
>>
>> The 36e2000 OMEGA SERVER ontology contains all the text that has
>> ever been written or ever will be written in the english language.
>>
>>
>> coordinates in the 36e2000 page dataset:
>>
>> GENERATE ALL VALUES FOR ALL COORDINATES
>> LINE BY LINE
>> PAGE BY PAGE
>> FROM A-Z
>> FROM (1x,1y,1z) TO (50x,40y,36e2000z)
>>
>> By writing all english text in a uniform, non-random, way throughout
>> the dataset, one can simply search/read the text by its position in
>> generating all 36e2000 pages first, then storing all 36e2000 pages,
>> then searching.
>>
>
>
>Chuck
>______________________________________________________________________
>
>Charles E. Matthews
> Software consulting in knowledge
>Synergistic Technologies based systems and object oriented
>chu...@infonet.isl.net analysis and design
>
Thankyou chu...@infonet.isl.net for your comments regarding the OMEGA
SERVER ontology.
*ANY* computer system attempting to generate all values for all (x,y,z)
coordinates in a 36e2000 page dataset would be running the application
beyond our lifetimes!!!
For this reason, Infowar Countermeasures for Encryption & Worm Apps
utilizing the OMEGA SERVER ontology should be explored by <dot mil>
and <dot gov> contractors.
The read/write program can also be used as a Cipher/Encryption program.
The /write program can be nested in a Worm App to disable any system.
jf...@poboxes.com
In article , he...@ecn.purdue.edu says...
>
>In article <1996071512...@avignon.hypereality.co.uk>, re...@remail.ecafe.org (ECafe Anonymous Remailer) writes:
>
>|> been written or ever will be written in the english language.
>
>
>end.
>
>|> Those individuals interested in developing and testing KDD Algorithms
>|> utilizing the OMEGA SERVER ontology please contact:
>
>Include me out.
>
>--
>Randy Helzerman
>http://yara.ecn.purdue.edu/~helz/
Thank you he...@ecn.purdue.edu for your comments regarding the OMEGA
SERVER ontology.
The *new approach* is a single read/write program generating all values
for all (x,y,z) coordinates in a uniform and non-random way. One can
simply search/read data by its position in the dataset (predetermined
by the read/write program *sequence*), without generating all data first,
then storing all data, then searching.
- - - - -
Individuals interested in developing and testing Knowledge Discovery
and Data Mining (KDD) Algorithms as a basis for coding read/write
programs please contact:
Bobbie Johnson
Charles E. Matthews wrote:
>
> ECafe Anonymous Remailer wrote:
> >
> > The 36e2000 OMEGA SERVER ontology contains all the text that has
> > ever been written or ever will be written in the english language.
> >
> >
> > coordinates in the 36e2000 page dataset:
> >
> > GENERATE ALL VALUES FOR ALL COORDINATES
> > LINE BY LINE
> > PAGE BY PAGE
> > FROM A-Z
> > FROM (1x,1y,1z) TO (50x,40y,36e2000z)
> >
> > By writing all english text in a uniform, non-random, way throughout
> > the dataset, one can simply search/read the text by its position in
> > the dataset (predetermined by the read/write program), without
> > generating all 36e2000 pages first, then storing all 36e2000 pages,
> > then searching.
> >
>
> Is this the AI equivalent of a perpetual motion machine?
>
> Chuck
> ______________________________________________________________________
>
> Charles E. Matthews
> Software consulting in knowledge
> Synergistic Technologies based systems and object oriented
> chu...@infonet.isl.net analysis and design
yes, but only more idiotic.
Bobbie Johnson
jf...@poboxes.com wrote:
>
> In article , "Charles says...
> >
> >ECafe Anonymous Remailer wrote:
> >>
> >>
> >
> >Is this the AI equivalent of a perpetual motion machine?
> >
> >Chuck
> >______________________________________________________________________
> >
> >Charles E. Matthews
> > Software consulting in knowledge
> >Synergistic Technologies based systems and object oriented
> >chu...@infonet.isl.net analysis and design
> >
>
> SERVER ontology.
>
> snip<
>
> For this reason, Infowar Countermeasures for Encryption & Worm Apps
> utilizing the OMEGA SERVER ontology should be explored by <dot mil>
> and <dot gov> contractors.
>
> The read/write program can also be used as a Cipher/Encryption program.
>
> The /write program can be nested in a Worm App to disable any system.
running the omega server would be the equivalent to Mr. Spock telling
the Interprise computer to compute the value of pi to its final digit,
which of course took all the computer's capacity and saved the
Interprise from a self destruct sequence. might work for the DoD!
Bobbie
jf...@poboxes.com
In article , Oliver says...
>
>
>I take it that this is a serious post and not flame bait?
>
>If the former, you ought to speak with Battelle about Galaxy,
>the civilianisation of the US DoD stringlet search engine. This
>works - why we do not know - by matching any text with several tens
>of thousands of random stringlets. The level of match to each
>represents a vector in a {several thousand} dimension space.
>Astonishingly, this maps texts such that adjacent points have adjacent
>subject matter. One can move one's cursor over a projection of this
>space and get alpine gardening -> greenhouse horticulture -> commercial
>tomato growing in one direction; and alpine gardening -> alpine floras ->
>drought resistant plants -> desert ecology in the other.
>
>This does not get around the point that you system, as I understand it,
>can type long enough and generate Hamlet, Hamlet with one letter wrong,
>not quite Hamlet, piglet, pork. The issue of finding authentic material in
>a sea of gibbersish and syntactically-correct but wrong material does not go
>away. One string 0000100111010101010000111 can be interpreted by
>an infinite number of look up tables, expanders and so forth to generate
>all of the digitised music that has been or will be composed. Finding something
>in the infinite sea is like listening to a detuned TV in the hope that a totally
>new version of Star Trek will assemble out of random numbers before your
>eyes. No doubt that it will, when the universe is cold and old and weary.
>
>_________________________________________________
>
> Oliver Sparrow
> oh...@chatham.demon.co.uk
>
The difference of the OMEGA SERVER ontology is that all the text files
in all the databases are transcribed into a single format, and, all
possible text files are generated in a non-random sequence by a single computer program using that format.
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
In the series of 26 characters above, find the characters:
J-F = I, H, G
F-T = G, H, I, J, K, L, M, N, O, P, Q, R, S
T-Z = U, V, W, X, Y
This is possible (without the complexity of multiple formats
or random values) because of the place-value system of the
english alphabet, predetermined by the read/write program *sequence*
of historical convention.
With the place-value of all characters in the 36^2000 page dataset
predetermined by a single read/write program, a search can be conducted
within a specified range [of (x), of (y), of (z), of (x,y), of (x,y,z)]
without generating all pages first, the storing all pages, then searching.
Only those pages within a specified range would be generated/searched
with the query response stored/displayed.
- - - - -
If each cycle (t) of a thousand lines of code (k-loc) of the read/write
program equals an order of magnitude increase in the (x,y,z) dataset,
then [t=0 to t=2000] is the 2000 cycle non-random sequence of the /write
program with a narrow range of (x,y,z) specified in the read/ program
to conduct a search.
- - - - -
jf...@poboxes.com (john michael fitzpatrick)
Norman Ma
In article <199607150658...@babyblue.cs.yale.edu> re...@remail.ecafe.org (ECafe Anonymous Remailer) writes:
OME>The english language contains 26 characters for the alphabet,
OME>nine characters for basic punctuation, and, one character for a
OME>spacing function.
OME>
OME>(36) to the power (2000) = 36e2000 pages
OME>
OME>...By writing all english text in a uniform, non-random, way throughout
OME>the dataset, one can simply search/read the text by its position in
OME>the dataset (predetermined by the read/write program), without
OME>generating all 36e2000 pages first, then storing all 36e2000 pages,
OME>then searching...
Not enough time
Not enough space
--Norm