Copy Link
Add to Bookmark
Report
AIList Digest Volume 2 Issue 099
AIList Digest Thursday, 2 Aug 1984 Volume 2 : Issue 99
Today's Topics:
AI Funding - Call for Questions,
LISP - IBM 4341 Implementation?,
Applications - Design and Test,
Journal - Symbolic Computation,
Book - Successful Dissertations and Theses by David Madsen,
Intelligence - Turing Test & Understanding,
Software Validation - Expert Systems,
Seminar - Speech Recognition Using Lexical Information
----------------------------------------------------------------------
Date: 1 Aug 84 09:54 PDT
From: stefik.pa@XEROX.ARPA
Subject: Call for Questions: AAAI panel on SC
DARPA's Strategic Computing initiative is going to be a major source of
funding for AI research (as well as other Computer Science research) in
the next several years. The project has been hailed as "just in time"
by people concerned with the levels and directions of funding for
research in Computer Science. It has also attracted the criticism of
those who are worried about the effect of military goals on funding, or
about dangers of trying to guide research too much.
Next Friday morning at the AAAI conference in Austin, there will be a
panel session during which several members of the DARPA staff will
present goals, ideas, and scales of this program. The presentation
will be followed by a question and answer period with me as moderator.
Some of the questions will come "live" from the audience.
Because the SC project will effect our research community in many ways,
I would like to make sure that the questions address a broad enough
range of issues. To this end I am now soliciting questions from the
community. I will select a sampling of "sent-in" questions to try to
provide a balance across issues of concern to the community -- anything
from funding levels, to research objectives, to 5th generation
comparisons, to the pace of the research, to expectations by the
military, to statements that have appeared in the press, etc.
Please send questions to me -- Stefik@Xerox.Arpa. Keep them short. I
don't want to wade through long paragraphs in search of a coherent
question. Think of questions that could fit easily on a 35 mm slide --
say 25 words or so. I expect to choose from these sent-in questions for
about half of the Q/A period.
Mark
------------------------------
Date: 30 Jul 84 9:50:07-PDT (Mon)
From: ihnp4!mhuxl!ulysses!unc!mcnc!philabs!cmcl2!lanl-a!cib @ Ucb-Vax.arpa
Subject: Query - LISP for IBM 4341?
Article-I.D.: lanl-a.11272
I would be very grateful for information on LISP dialects
for the IBM 4341, and sources thereof.
Thank you.
------------------------------
Date: Thu 2 Aug 84 10:43:10-PDT
From: Ken Laws <Laws@SRI-AI.ARPA>
Reply-to: AIList-Request@SRI-AI
Subject: IEEE Design & Test
The July issue of IEEE Computer Graphics mentions that IEEE Design & Test
of Computers is seeking submissions for a special August 1985 issue on
artificial intelligence techniques in design and test. They particularly
solicit material on AI in design automation, CAD, and CAT, and on
expert systems, automatic design systems, test generation and system
diagnosis, natural-language CAD interfaces, and special-purpose hardware
to support AI systems.
Submit four copies by December 1 to Guest Editor Donald E. Thomas,
ECE Department, Carnegie-Mellon University, Pittsburgh, PA 15213,
(412) 578-3545.
-- Ken Laws
------------------------------
Date: Thu 12 Jul 84 13:49:29-CDT
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: New Journal/Call for Papers
The Journal of Symbolic Computation (published by Academic Press, London) will
publish original articles on all aspects of the algorithmic treatment of
symbolic objects (terms, formulae, programs, algebraic and geometrical
objects). The emphasis will be on the mathematical foundation, correctness and
complexity of new sequential and parallel algorithms for symbolic computation.
However, the description of working software systems for symbolic computation
and of general new design principles for symbolic software systems and
applications of such systems for advanced problem solving are also within the
scope of the journal.
Manuscripts should be sent in triplicate to:
B. Buchberger, Editor
Journal of Symbolic Computation
Johannes-Kepler-Universitat
A4040 Linz, Austria
Associate Editors: W. Bibel, J. Cannon, B. F. Caviness, J. H. Davenport, K.
Fuchi, G. Huet, R. Loos, Z. Manna, J.Nievergelt, D. Yun.
------------------------------
Date: Wed 1 Aug 84 09:50:42-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Successful Dissertations and Theses by David Madsen
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
Successful Dissertations and Theses; a guide to graduate student research
from proposal to completion by David Madsen LB2369.M32 1983 c.3, is
currently on the New Books Shelf in the Math/CS Library. HL
------------------------------
Date: 25 Jul 84 9:54:00-PDT (Wed)
From: pur-ee!uiucdcs!ea!mwm @ Ucb-Vax.arpa
Subject: Re: Should The Turing test be modified w - (nf)
Article-I.D.: ea.500002
>What I am wondering is "should the Test be modified
>to Our times?"
I don't think so; at least not with the video link you mentioned. A key
element in the Turing Imitation game was that it hid the handicaps suffered
by the computer, leaving only the (possible) intelligence exposed. If you
could modify it without subtracting that property, then I'd say yes. It
just isn't clear that that can be done.
>I can see it now,
>over a crude link, we discover that we cannot tell the difference between
>man and machine, then we hook up a video link, and the difference 'becomes
>apparent.'
If that were the case, it would seem that the "apparent difference" would
be identical to the difference you get between a blind man and a sighted
man. Are we therefore to conclude that the blind are only artificially
intelligent?
>--eugene miya
> NASA Ames Research Center
<mike
------------------------------
Date: 30 Jul 84 10:25 PDT
From: Woody.pasa@XEROX.ARPA
Subject: Turing tests
There's this accounting computer at the Santa Fe, (where my dad works),
and before it was installed, accounting was something which needed a very
intelligent person to do. It required a high level of intelligence to keep
the books balanced, the type of intelligence a machine could never have.
The Santa Fe uses a computer to keep all their books now.
But note that the discussion with accounting is now not "The computer is
intelligent--look, it can keep the accounting books for an entire company",
but "Gee, anyone can keep the accounting books; even a computer."
The Turing test is a poor test, granted; but can there be a more
generalized test to tell if a computer is truly intelligent? With the
Turing test, we can give the computer and the human at the other end a
test in math, understanding, and creativity; we could even talk about
the presidential elections; we're not restricted to the things that
have been discussed earlier.
As for hooking up a camera to the computer and using visual
identification as a test for intelligence: I know of a few blind
people who would be hard-pressed to past that test. Sure, it takes a
lot to be able to see, but then most mice can see, and some humans
cannot; does that make the mice smarter than the humans?
- Bill Woody
1-60 Caltech
Pasadena, CA 91126
------------------------------
Date: 25 Jul 84 12:06:17-PDT (Wed)
From: hplabs!hao!seismo!rochester!rocksvax!rocksanne!sunybcs!gloria!colonel
@ Ucb-Vax.arpa
Subject: Re: can computers understand?
Article-I.D.: gloria.400
As long as the problem of "understanding" has come up again, here's
a provoking quotation:
In this argument [deleted] commits two blunders. He interprets
understanding as the limit of an evolutionary process of
baconian observation, and he treats understanding, like
intelligence, as a fixed property independent of its
possessor.
To understand is to assimilate a process foreign to oneself. A
machine does not "understand" how to make screw eyes, because
that is part of its function. ... When we examine [deleted]'s
argument closely, it reduces to two familiar ideas: the
logical idea that all understanding rests on knowledge of the
principles of physics, and the psychological idea that
understanding is necessary for the sake of controlling.
... The ideal of [deleted]'s theory would be a computer that
"understands" natural language well enough to be able to make
people do its bidding.
--Maia I. Aimless (1979)
--
Col. G. L. Sicherman
...seismo!rochester!rocksanne!rocksvax!sunybcs!gloria!colonel
------------------------------
Date: 5 Jul 84 10:10:42-PDT (Thu)
From: hplabs!sdcrdcf!sdcsvax!akgua!mcnc!philabs!linus!vaxine!wjh12!harvard
!seismo!hao!ames-lm!eugene @ Ucb-Vax.arpa
Subject: Expert System Test
Article-I.D.: ames-lm.383
With regard to expert systems, I thought of an interesting
[take this with a grain of salt] set of tests to evolve or refine
the development of such systems. These tests would test the expertise
of such systems. Take a classic system like MYCIN.
When the developers feel the system is ready for a shake down,
[remember, this is not entirely serious, but not for the weak of heart]
infect the developers of the system with one of the diseases in the
knowledgebase, and let them diagnose their own ailment.
There might be interesting evolutionary consequences in software development.
Similarly, other people developing other systems would put their
faith and lives on the line for the software systems they develop.
Are these systems, truly 'expert?'
Admittedly, not a rigorous test, but neither was Turing's.
The above are opinions of the author and not the funding Agency.
--eugene miya
NASA Ames Research Center
{hplabs,hao,dual}!ames-lm!aurora!eugene
------------------------------
Date: Wed 1 Aug 84 18:45:25-PDT
From: Dikran Karagueuzian <DIKRAN@SU-CSLI.ARPA>
Subject: Seminar - Speech Recognition Using Lexical Information
[Forwarded from the CSLI Newsletter by Laws@SRI-AI.]
LEXICAL ACCESS USING PARTIAL INFORMATION
By Daniel P. Huttenlocher, Massachusetts Institute of
Technology, Friday, August 3, 2 p.m. in the Trailers'
Conference Room next to Ventura Hall.
ABSTRACT: Current approaches to speech recognition rely on classical
pattern matching techniques which utilize little or no language knowledge.
We have recently proposed a model of word recognition which uses
speech-specific knowledge to access words on the basis of partial
information. These partial descriptions serve to partition a large lexicon
into small equivalence classes using sequential phonetic and prosodic
constraints. The representation is attractive for speech recognition system
because it allows all but a small number of word candidates to be excluded
using only a crude description of the acoustic signal. For example, if the
word ``splint'' is represented according to the broad phonetic string
[fricative][stop][liquid][vowel][nasal][stop], there are only two matching
words in the 20,000 word Webster's Pocket Dictionary, ``splint'' and ``sprint.''
Thus, a partial representation can both greatly reduce the space of possible
word candidates, and be relatively insensitive to variability in the speech
signal across utterance situations. This talk will discuss a set of studies
examining the power of such partial lexical representations.
------------------------------
End of AIList Digest
********************
