Hi Harold,

Do you think an algorithm (no matter how complex) can ever be called
intelligent? Another way of asking this is, do you consider chess
programs available today to be engaging in "machine thinking"? If so, how
do you define the term "machine thinking"?

Terren

--- "Harold P. Boushell" <haroldpboushell@...> wrote:

> Stephen Smalley: 02MAR2006
>
> I have much on this subject "AI".
> My thinking goes to methods to take
> WORDS to NUMBERS, with Genetic Algorithms
> to fill MATRIX string compares, with
> SHORT TERM MATRIX vs. LONG TERM MATRIX
> comparisons to perform a "partial differentiation"
> on the strings, which are praised into (SVO, AND VOS),
> [subject verb object, and verb object subject], forms
> with data base comparisons of the numerical "genes"
> within the formatted 65565 sub-groups of meaning.
>
> All this is for machine thinking. Such that it really
> does know the difference between:
>
> {
>
> Put the pen on the table.
>
> and
>
> Put the table on the pen.
>
> }
>
> and many more examples.
>
> What I am looking for is a Grant for two years
> to work full time on a feasibility study. Some
> used hardware, or new which ever is more
> advantageous, and some software help
> which I feel your agency (NSA) already has
> done many years ago.
>
> This problem is not new, however, I feel
> my approach is new. Storage seems to be
> a problem. I believe problem approaches
> 229 billion directories (at or near on line).
> That size of storage is beyond my reach,
> 5.49^14 bytes. CPUs at 306 GHZ on line.
>
> Please feel free to send this to anyone who
> might know how help me on this subject..
>
>
> I am hoping your “OUTREACH PROGRAM”
> might be of some use in this area.
> Looking forward to your timely replay.
>
> Harold P Boushell
> haroldpboushell@...
>
>
> *************************************************
> >From: "Harold P. Boushell" <haroldpboushell@...>
> >Reply-To: arcondev@yahoogroups.com
> >To: arcondev@yahoogroups.com
> >CC: haroldpboushell@...
> >Subject: [arcondev] RE: BINARY ENGLISH WORDS
> >Date: Mon, 13 Feb 2006 11:34:29 -0800
> >
> >Hi Alan: 13FEB2006
> >
> >As you can see there is more to this than just ranking the words
> >by size. Remember the Definitions must read forwards and backwards.
> >
> >00001 .RUN "THINK_BUILD_DIRECTORYS"
> >00002 .ZERO = 0
> >00003 .ONE = 1 ***************************************
> >00004 .TWO = 2 *** ***
> >00005 .THREE = 3 *** "BINARY-WORDS" 00001-01024 ***
> >00006 .FOUR = 4 *** UBIQUITOUS = ever present ***
> >00007 .FIVE = 5 *** without proof - words are ***
> >00008 .SIX = 6 *** at hard-wire level thought ***
> >00009 .SEVEN = 7 *** start with XXXXX line number. ***
> >00010 .EIGHT = 8 *** ***
> >00011 .NINE = 9 ***************************************
> >00012 .TEN = 10
> >00013 .CARRY = { move to next power of ten }
> >00014
> >00015 .PLUS = "+"
> >00016
> >00017 .SET = { MANY OF((((ICON) OR WORD) OR NUMBER) OR STRING) }
> >00018
> >00019 .THING = { ONE SET }
> >00020
> >00021 .SOMETHING = { un-determined or un-specified thing }
> >00022 .OR = { “IF_NOT_SOMETHING_THEN_SOMETHING” }
> >00023 .ADD = { SOMETHING + SOMETHING }
> >00024
> >00025 .SOME = { ONE TO FIVE SOMETHING SMALL }
> >00026
> >00027
> >00028 .SUBTRACT = { SOMETHING - SOMETHING }
> >00029 .MULTIPLY = { SOMETHING * SOMETHING }
> >00030 .DIVIDE = {SOMETHING / SOMETHING }
> >00031 .NO = { STOP SOMETHING }
> >00032
> >00033 .NOT = { NO SOMETHING }
> >00034
> >00035 .SUB = { under or beneath or subordinate or secondary }
> >00036
> >00037 .AND = SOMETHING ADD SOMETHING
> >00038
> >00039 .STOP = FINISH SOMETHING
> >00040
> >00041 .LINE = .FORMAT(X2,0,0) - FORMAT(X1,0,0)
> >00042
> >00043 .FORMAT(x,y,z) = { front of something and un-mistakable many line
> }
> >00044
> >00045 .THE = ONE OF FORMAT(X,Y,Z) SOMETHING
> >00046
> >00047 .DIGIT = { SET LIKE 1 or 2 or 3 or 4 or 5 or 6 or 7 or 8 or 9 or
> 0 }
> >00048
> >00049 .MUCH = { grate in quantity or extent or degree }
> >00050
> >00051 .SUBSTANCE = { PHYSICAL MATERIAL ESSENCE }
> >00052
> >00053 .NUMBER = { DIGIT SET or "N" }
> >00054
> >00055 .COUNT = NUMBER + 1
> >00056
> >00057 .WITH = FORMAT(X,Y,Z) AND SOMETHING
> >00058
> >00059 .UNION = WITH SOMETHING AND SOMETHING
> >00060
> >00061 .PURE = { foreign mass no and no corruption }
> >00062
> >00063
> >00064
> >00065 .SAME = { COUNT PATH alike }
> >00066
> >00067 .STATE = { SMALL SET MENY DIGIT SOMETHING }
> >00068
> >00069 .FOND = HAS IDEA MUCH CARING
> >00070
> >00071 .LOVE = FOND MUCH STATE
> >00072
> >00073
> >00074
> >00075 .GOD = IN BEGING WAS WORD AND WORD WITH ALL AND WORD WAS ALL
> >00076
> >00077
> >00078
> >00079 .HOLY = ALL WITH WORD ALL WAS WORD ALL WAS PURE GOD WAS HAPPY
> >00080
> >00081
> >00082
> >00083 .GOOD = ALL SAME HOLY LOVE
> >00084
> >00085
> >00086
> >00087 .HAPPY = MUCH GOOD SOMETHING ALL
> >00088
> >00089 .MEMBER = SOMETHING UNION SET ONE
> >00090
> >00091 .LIKE = { MUCH HAPPY MEMBER OF SET }
> >00092
> >00093 .A = ONE SOMETHING
> >00094
> >00095 .ABOUT = ON EVERY SIDE NEAR SOMETHING
> >00096
> >00097 .EQUAL = { THE SAME }
> >00098
> >00099 .LESS = SUB SET SOMETHING
> >00100
> >00101 .FEW = LESS THAN FIVE SOMETHING
> >00102
> >00103 .YES = { like about something }
> >00104
> >00105 .MORE = ADD SOMETHING TO SOMETHING MUCH
> >00106
> >00107 .PATH = { route or course }
> >00108
> >00109 .IF = YES OR NO
> >00110
> >00111 .MANY = { THREE AND MORE }
> >00112
> >00113 .WORK = MOVE MASS PATH FORMAT(X,Y,Z)(X2-X1)
> >00114
> >
> >by for now
> >
> >Harold
> >
> >haroldpboushell@...
> >[ public information not secret OK :) ]
> >
> >
> >**************************************************
> > >From: "Harold P. Boushell" <haroldpboushell@...>
> > >To: arcondev@yahoogroups.com
> > >Subject: BINARY ENGLISH WORDS
> > >Date: Tue, 10 Jan 2006 19:13:10 -0800
> > >
> > >Hi Alan: 10JAN2006
> > >
> > >I'm still working on my binary words in ENGLISH.
>
=== message truncated ===