Copy Link
Add to Bookmark
Report
AIList Digest Volume 2 Issue 101
AIList Digest Sunday, 5 Aug 1984 Volume 2 : Issue 101
Today's Topics:
AI Tools - DOE MACSYMA,
Intelligence - Turing Test,
Games - Chess Delphi Game & Zebra Problem,
Seminar - Learning Implementation Rules in Circuit Design
----------------------------------------------------------------------
Date: 30 July 1984 16:36-EDT
From: Harten.Paradigm at MIT-MULTICS.ARPA
Subject: DOE MACSYMA AVAILABLE FOR NOMINAL FEE
[Forwarded from the Arpanet-BBoards distribution by Laws@SRI-AI.]
DOE MACSYMA AVAILABLE FOR NOMINAL FEE
This message should receive the widest possible re-transmission.
Paradigm Associates, Inc. is pleased to announce that the DOE
MACSYMA program is available from NESC. DOE MACSYMA runs on the
DEC VAX-series of computers under the VMS operating system, and
corresponds quite closely with the 1982 version of MIT-MC MACSYMA
(the translator/compiler interface work, but advanced plotting
features need work.) Those not already a member of NESC should
contact:
National Energy Software Center
Argonne National Laboratory
9700 South Cass Avenue
Argonne, Illinois 60439
Attention: Jan Mockler
for information about joining, and should inquire about accession
number 9847. We are advised that there are two VAX-VMS BACKUP
format tapes with 40 MB of code: source to DOE MACSYMA and NIL,
object modules, executable images, control and auxiliary
information. This work is supported by DOE Contract W-7405-ENG-48.
Users wishing to contribute programs and codes to the New MACSYMA
Users Consortium, for re-distribution through NESC, may send their
material to Leo Harten, Paradigm Associates, Inc., 29 Putnam
Avenue, Suite 6, Cambridge, MA 02139, or to
Harten@Mit-Multics (Multics mail is no longer case-sensitive).
[This is a volunteer effort for the improvement of the SHARE
libraries in DOE MACSYMA.]
------------------------------
Date: 31 Jul 84 13:54:05-PDT (Tue)
From: ihnp4!mhuxl!ulysses!unc!mcnc!philabs!linus!utzoo!dciem!mmt@Ucb-Vax.arpa
Subject: Re: Should The Turing test be modified
Article-I.D.: dciem.1012
The Turing test played over a teletype can give way to one played
over a graphics terminal without laying any less bare the intelligence
causing the display. But there is an interesting lead article in
a recent issue of Science (July something) on impacts of computers,
which has something possibly relevant to say. In the experience of
IBM, the networking facilities have been used almost never by scientists
to do joint work from one site to another, sometimes by engineers
on major projects, and frequently by managers. Could it be that the
subtle concepts required by scientists do not transmit well over
current technology, but that the simpler ideas used repetitively by
managers are satisfactorily handled?
If there is some kind of a technology limitation on the power of
thought conveniently communicated, then the Turing Game should be
updated whenever new technology permits. The only thing that should
be unfair is to demand a sight of the testee, or to demand that
he/she/it move voluntarily or perform actions not expressible on
a current technology computer terminal.
--
Martin Taylor
{allegra,linus,ihnp4,uw-beaver,floyd,ubc-vision}!utzoo!dciem!mmt
------------------------------
Date: 3 Aug 84 11:35-PDT
From: mclure @ Sri-Unix.arpa
Subject: chess delphi game
Since the chess delphi game moves are not being published on
ailist any more, I would like to point out that one list
does receive the moves. It is chess@sri-unix. If you would
like to be added, send a note to chess-request@sri-unix.
We're on move 5 of the delphi game now.
Stuart
------------------------------
Date: 2 Aug 84 14:05:11-PDT (Thu)
From: hplabs!hpda!fortune!amd!decwrl!dec-rhea!dec-kirk!williams@Ucb-Vax.arpa
Subject: Some thoughts on problem solving
Article-I.D.: decwrl.3076
SYMBOLOGY AND THE STUDY OF PROBLEMS
Here is a problem which was presented to me in net.puzzle.
First I will solve the problem and then describe a proposed method of
solving it artificially.
Newsgroups: net.puzzle
Path: decwrl!decvax!ittvax!dcdwest!sdcsvax!sdcrdcf!hplabs!tektronix
!teklds!azure!harriett
Subject: WHO OWNS THE ZEBRA
Posted: Mon Jul 30 13:14:07 1984
The following is a brainteaser I got a long time ago. Many have tried
and failed, many have guessed. It is possible to solve alone or in a group.
If you really want to give yourself a brain hernia, try to solve it in you
head without writing anything down (It can be done, that is the way I solved
it the first time I tried it, it took about 15 to 20 hours over a three day
period!!!!!!) [...]
WHO OWNS THE ZEBRA .................
ON A CITY STREET, STRANGER ACCOSTS STRANGER WITH A XEROXED SHEET OF PAPER
AND THE QUESTION: "HAVE YOU SEEN THIS?". IN UNIVERSITY DORMITORIES THE
PROBLEM IS TACKED TO DOORS, MUCH AFTER THE MANNOR OF MARTIN LUTHER.
IN SUBURBAN HOUSEHOLDS THE RING OF THE TELEPHONE IS LIKLEY TO HEARLD
A VOICE THAT ASKS 'IS IT THE NORWEGIAN?'
THE CAUSE OF THE EXCITEMENT IS THE BRAINTEASER BELOW. IT'S HARD, BUT
CAN BE SOLVED BY USING DEDUCTION, ANAYLSIS, AND A LOT OF PERSISTENCE.
1. THERE ARE FIVE HOUSES, EACH OF A DIFFERENT COLOR AND INHABITED BY
MEN OF DIFFERENT NATIONALITIES, WITH DIFFERENT PETS, DRINKS, AND
CIGARETTES.
2. THE ENGLISHMAN LIVES IN THE RED HOUSE
3. THE SPANIARD OWNS THE DOG.
4. COFFEE IS DRUNK IN THE GREEN HOUSE
5. THE UKRAINIAN DRINKS TEA.
6. THE GREEN HOUSE IS IMMEDIATELY TO THE RIGHT (YOUR RIGHT) OF THE
IVORY HOUSE.
7. THE OLD GOLD SMOKER OWNS SNAILS.
8. KOOLS ARE BEING SMOKED IN THE YELLOW HOUSE.
9. MILK IS DRUNK IN THE MIDDLE HOUSE.
10. THE NORWEGIAN LIVES IN THE FIRST HOUSE ON THE LEFT.
11. THE CHESTERFIELD SMOKER LIVES NEXT TO THE FOX OWNER.
12. KOOLS ARE SMOKED IN THE HOUSE NEXT TO THE HOUSE
WHERE THE HORSE IS KEPT.
13. THE LUCKY STRIKE SMOKER DRINKS ORANGE JUICE.
14. THE JAPANESE SMOKES PARLAIMENTS.
15. THE NORWEGIAN LIVES NEXT TO THE BLUE HOUSE.
NOW ...........
WHO DRINKS WATER?
AND ...........
WHO OWNS THE ZEBRA?
GOOD LUCK!
................ put that in your .bin and smoke it!!!!!
Harriette L. Lilly
Tektronix MDP Marketing
Technical Support
Beaverton ORG.
tekmdp!harriett
[I first saw this problem in Reader's Digest about 1964 -- does anyone
know the original source? My first LISP program was an attempt to solve
this puzzle by simple constraint propagation (or elimination of terms
in the space of all conceivable solutions). The program had some
trouble with the "next to" or "right of" relations, since these had
to be expressed as a set of more primitive constraints that I entered
by hand. The program ultimately failed when it reached a choice point
requiring a binary choice and possible backtracking; I had not built
such sophistication into the control structure. -- KIL]
************************* SPOILER WARNING ******************************
The answer to the five house problem is not so straight forward.
The first step to take was to solve the orientation of the houses.
The second house to the left was blue, being next to the norwegian on the
far left. The norwegian could not be red, that belonging to the englishman.
The norwegian could not be ivory, because of it's relative orientation to
green, nor could it be green leaving the second house from the left ivory.
The norwegian owned the yellow house. The middle house could not be green,
for the middle house drank milk, and not coffee, nor could it be ivory,
making the second house green, so it was red. The green and ivory fell into
place at this point.
YELLOW BLUE RED GREEN IVORY
Norwegian English
Horse
Milk Coffee
Kools
The next step was to resolve who had what cigarettes.
The norwegian had the kools, which were in the yellow house, and the japanese
had the parliaments. Neither the ukrainian nor the englishman could have the
lucky strikes because they had a different drink than orange juice. This
meant that the old golds and the chesterfields were mutually inclusive to
the ukrainian and the englishman leaving the spaniard having the lucky
strikes.
The next step was to solve who had what drinks.
The ukrainian had the tea, the englishman had the milk, and the spaniard
had the orange juice. This meant that the water and coffee were mutually
inclusive to the norwegian and the japanese. Since the norwegian's house
was yellow, he could not have the coffee. Therefore, the japanese had the
coffee and the NORWEGIAN HAD THE WATER.
The next step was to solve who lived where.
The norwegian lived in the yellow house, the englishman lived in the red
house, and because the japanese drank coffee, the japanese lived in the
green house. This meant that the blue and the ivory houses were mutually
inclusive to the ukranian and the spaniard. Since the blue house had a
horse, and the spaniard had a dog, this meant that the ukrainian owned
the blue house and the spaniard owned the ivory house.
The next step was to solve who had what cigarettes previously incomplete.
The old gold and the chesterfields belonged mutually inclusively to the
ukrainian and the englishman. Since the ukrainian lived in the blue and
had the horse, and the man with the snails also had the old golds, the
ukrainian had the chesterfields and the englishman had the old golds.
The next step was to solve who had what animals.
The ukrainian had the horse, the englishman had the snails, and the
spaniard had the dog. This meant that the fox and zebra belonged mutually
inclusively to the norwegian and japanese. Since the japanese did not live
next to the ukrainian, who had the chesterfields, he could not have the
fox. Therefore, the norwegian had the fox and the JAPANESE OWNED THE ZEBRA.
YELLOW BLUE RED GREEN IVORY
Norwegian Ukrainian English Japanese Spaniard
Fox Horse Snails Zebra Dog
Water Tea Milk Coffee Juice
Kools Chesterfields Old Golds Parliaments Lucky Strikes
This one definitely had a few wrinkles.
John Williams Digital Equipment Corperation
It appears to me as though the key to solving this problem was to
discover mutually inclusive sets of symbols, in this case, pairs.
Given:
a = x or y
b = x or y
a <> b <> c
c = x or y or z
Then:
c = z
This could be utilized by first defining sets ( or lists, for you lisp fans ),
of the various categories, owners, pets, drinks, etc., and a basic initial
condition. That is, each symbol has with it a list of possible connections.
The englishman is exclusively connected to the color red, whereas the japanese
is connected to all colors. The norwegian is connected to the left most house,
etc. The process is accomplished by rotating the context, that is, looking
for inclusive sets in convoluting categories, eliminating possible connections
until a stable state is achieved.
When I solved the problem, or should I say, when I wrote down the answer,
I naturally chose the most direct context switches for analysis. I do
not believe that this is nessesary. It would only mean that in an artificial
analysis, there would be contexts where analysis would not perform any
reductions. The choice of context was on my part, intuitive, and for a
finite problem, would only mean an increase in the amount of time required
to solve the problem, or prove it couldn't be solved.
I think a program like this would be an interesting study of problem
reduction. The formation of symbols in this program would be an even
more interesting problem.
< puzzled? >
(DEC E-NET) KIRK::WILLIAMS
(UUCP) {decvax, ucbvax, allegra}!decwrl!dec-rhea!dec-kirk!williams
(ARPA) williams%kirk.DEC@decwrl.ARPA
williams%kirk.DEC@Purdue-Merlin.ARPA
------------------------------
Date: 3 Aug 84 13:04:46 EDT
From: LOUNGO@RUTGERS.ARPA
Subject: Seminar & Binding - Learning Circuit Design
[Forwarded from the Rutgers bboard by Laws@SRI-AI.]
R U T G E R S U N I V E R S I T Y
Department of Computer Science
COLLOQUIUM
Speaker: Masanobu Watanabe
Title: LEARNING IMPLEMENTATION RULES IN CIRCUIT DESIGN
BY HARMONIZING BEHAVIORS WITH SPECIFICATIONS
Date: Friday, August 3, 1984
The problem of expertise acquisition by monitoring the user's response to
advice offered by the system is considered here as an implementation
rule acquisition problem in a domain of VLSI circuit design. The task
is characterized as learning a Macro-operator in a problem space,
where data-streams and modules are viewed as states and operators,
respectively. A Goal-Directed-Learning [Mitchell 83a] approach toward
justifiable generalization by analyzing a single training instance is
then applied to this problem. Both the usefulness of its approach and
the remaining issues are clarified by examination through examples.
Masanobu Watanabe will be leaving Rutgers to return to Japan.
His office address is:
Computer System Research Laboratory
C&C Systems Research Laboratories
NEC Corporation
1-1, Miyazaki 4-Chome,
Miyamae-Ku, Kawasaki
Kanagawa 213 Japan
Tel (044)855-1111 ex.2275
------------------------------
End of AIList Digest
********************
