Copy Link
Add to Bookmark
Report
AIList Digest Volume 2 Issue 012
AIList Digest Saturday, 4 Feb 1984 Volume 2 : Issue 12
Today's Topics:
Hardware - Lisp Machine Benchmark Request,
Machine Translation - Request,
Mathematics - Fermat's Last Theorem & Four Color Request,
Alert - AI Handbooks & Constraint Theory Book,
Expert Systems - Software Debugging Correction,
Course - PSU's Netwide AI Course,
Conferences - LISP Conference Deadline & Cybernetics Congress
----------------------------------------------------------------------
Date: Wed, 1 Feb 84 16:37:00 cst
From: dyer@wisc-ai (Chuck Dyer)
Subject: Lisp Machines
Does anyone have any reliable benchmarks comparing Lisp
machines, including Symbolics, Dandelion, Dolphin, Dorado,
LMI, VAX 780, etc?
Other features for comparison are also of interest. In particular,
what capabilities are available for integrating a color display
(at least 8 bits/pixel)?
------------------------------
Date: Thu 2 Feb 84 01:54:07-EST
From: Andrew Y. Chu <AYCHU@MIT-XX.ARPA>
Subject: language translator
[Forwarded by SASW@MIT-ML.]
Hi, I am looking for some information on language translation
(No, not fortran->pascal, like english->french).
Does anyone in MIT works on this field? If not, anyone in other
schools? Someone from industry ? Commercial product ?
Pointer to articles, magazines, journals etc. will be greatly appreciated.
Please reply to aychu@mit-xx. I want this message to reach as
many people as possible, are there other bboards I can send to?
Thanx.
------------------------------
Date: Thu, 2 Feb 84 09:48:48 PST
From: Charlie Crummer <crummer@AEROSPACE>
Subject: Fermat's Last Theorem
Fortunately (or unfortunately) puzzles like Fermat's Last Theorem, Goldbach's
conjecture, the 4-color theorem, and others are not in the same class as
the geometric trisection of an angle or the squaring of a circle. The former
class may be undecidable propositions (a la Goedel) and the latter are merely
impossible. Since one of the annoying things about undecidable propositions
is that it cannot be decided whether or not they are decidable, (Where are
you, Doug Hofstader, now that we need you?) people seriously interested in
these candidates for undecidablilty should not dismiss so-called theorem
provers like A. Arnold without looking at their work.
I have heard that the ugly computer proof(?) of the 4-color theorem that
appeared in Scientific American is incorrect, i.e. not a proof. I also
have heard that one G. Spencer-Brown has proved the 4-color theorem. I
do not know whether either of these things is true and it's bugging me!
Is the 4-color theorem undecidable or not?
--Charlie
------------------------------
Date: 30 Jan 84 19:48:36-PST (Mon)
From: pur-ee!uiucdcs!uicsl!keller @ Ucb-Vax
Subject: AI Handbooks only .95
Article-I.D.: uiucdcs.5251
Several people here have joined "The Library of Computer and
Information Sciences Book Club" because they have an offer of the complete
AI Handbook set (3 vols) for $3.95 instead of the normal $100.00. I got mine
and they are the same production as non book club versions. You must buy
three more books during the comming year and it will probably be easy to
find ones that you want. Here's the details:
Send to: The Library of Computer and Information Sciences
Riverside NJ 08075
Copy of Ad:
Please accept my application for trial membership in the Library of Computer
and Information Sciences and send me the 3-volume HANDBOOK OF ARTIFICIAL
INTELLIGENCE (10079) billing me only $3.95. I agree to purchase at least
three additional Selections or Alternates over the next 12 months. Savings
may range up to 30% and occasionally even more. My membership is cancelable
any time after I buy these three books. A shipping and handling charge is
added to all shipments.
No-Risk Guarantee: If you are not satisfied--for any reason--you may return
the HANDBOOK OF ARTIFICIAL INTELLIGENCE within 10 days and your membership
will be canceled and you will owe nothing.
Name ________
Name of Firm ____ (if you want subscription to your office)
Address _____________
City ________
State _______ Zip ______
(Offer good in Continental U.S. and Canada only. Prices slightly higher in
Canada.)
Scientific American 8/83 7-BV8
-Shaun ...uiucdcs!uicsl!keller
[I have been a member for several years, and have found this club's
service satisfactory (and improving). The selection leans towards
data processing and networking, but there have been a fair number
of books on AI, graphics and vision, robotics, etc. After buying
several books you get enough bonus points for a very substantial
discount on a selection of books that you passed up when they were
first offered. I do get tired, though, of the monthly brochures that
use the phrase "For every computer professional, ..." in the blurb for
nearly every book. If you aren't interested in the AI Handbook,
find a current club member for a list of other books you can get
when you enroll. The current member will also get a book for signing
you up. -- KIL]
------------------------------
Date: 31 Jan 84 19:55:24-PST (Tue)
From: pur-ee!uiucdcs!ccvaxa!lipp @ Ucb-Vax
Subject: Constraint Theory - (nf)
Article-I.D.: uiucdcs.5285
*********************BOOK ANNOUNCEMENT*******************************
CONSTRAINT THEORY
An Approach to Policy-Level
Modelling
by
Laurence D. Richards
The cybernetic concepts of variety, constraint, circularity, and
process provide the foundations for a theoretical framework for the
design of policy support systems. The theoretical framework consists
of a modelling language and a modelling mathematics. An approach to
building models for policy support sys- tems is detailed; two case
studies that demonstrate the approach are described. The modelling
approach focuses on the structure of mental models and the subjec-
tivity of knowledge. Consideration is given to ideas immanent in
second-order cybernetics, including paradox, self-reference, and
autonomy. Central themes of the book are "complexity", "negative
reasoning", and "robust" or "value-rich" policy.
424 pages; 23 tables; 56 illustrations
Hardback: ISBN 0-8191-3512-7 $28.75
Paperback:ISBN 0-8191-3513-5 $16.75
order from:
University Press of America
4720 Boston Way
Lanham, Maryland 20706 USA
------------------------------
Date: 28 Jan 84 0:25:20-PST (Sat)
From: pur-ee!uiucdcs!renner @ Ucb-Vax
Subject: Re: Expert systems for software debugging
Article-I.D.: uiucdcs.5217
Ehud Shapiro's error diagnosis system is not an expert system. It doesn't
depend on a heuristic approach at all. Shapiro tries to find the faulty part
of a bad program by executing part of the program, then asking an "oracle" to
decide if that part worked correctly. I am very impressed with Shapiro's
work, but it doesn't have anything to do with "expert knowledge."
Scott Renner
{ihnp4,pur-ee}!uiucdcs!renner
------------------------------
Date: 28 Jan 84 12:25:56-PST (Sat)
From: ihnp4!houxm!hocda!hou3c!burl!clyde!akgua!sb1!sb6!bpa!burdvax!psuvax!bobgian @ Ucb-Vax
Subject: PSU's Netwide AI course
Article-I.D.: psuvax.432
The PSU ("in person") component of the course has started up, but things
are a bit slow and confused regarding the "netwide" component.
For one thing, I am too busy finishing a thesis and teaching full-time to
handle the administrative duties, and we don't (yet, at least) have the
resources to hire others to do it.
For another, my plans presupposed a level of intellectual maturity and
drive that is VERY rare in Penn State students. I believe the BEST that
PSU can offer are in my course right now, but only 30 percent of them are
ready for what I wanted to do (and most of THEM are FACULTY!!).
I'm forced to backtrack and run a slightly more traditional "mini" course
to build a common foundation. That course essentially will read STRUCTURE
AND INTERPRETATION OF COMPUTER PROGRAMS by Hal Abelson and Gerry Sussman.
[This book was developed for the freshman CS course (6.001) at MIT and will
be published in April. It is now available as an MIT LCS tech report by
writing Abelson at 545 Technology Square, Cambridge, MA 02139.]
The "netwide" version of the course WILL continue in SOME (albeit perhaps
delayed) form. My "mini" course should take about 6 weeks. After that
the "AI and Mysticism" course can be restarted.
For now, I won't create net.ai.cse but rather will use net.ai for
occasional announcements. I'll also keep addresses of all who wrote
expressing interest (and lack of a USENET connection). Course
distributions will go (low volume) to that list and to net.ai until
things start to pick up. When it becomes necessary we will "fork off"
into a net.ai subgroup.
So keep the faith, all you excited people! This course is yet to be!!
Bob
Bob Giansiracusa (Dept of Computer Science, Penn State Univ, 814-865-9507)
UUCP: bobgian@psuvax.UUCP -or- allegra!psuvax!bobgian
Arpa: bobgian@PSUVAX1 -or- bobgian%psuvax1.bitnet@Berkeley
Bitnet: bobgian@PSUVAX1.BITNET CSnet: bobgian@penn-state.csnet
USnail: 333 Whitmore Lab, Penn State Univ, University Park, PA 16802
------------------------------
Date: Fri 3 Feb 84 00:24:28-EST
From: STEELE%TARTAN@CMU-CS-C.ARPA
Subject: 1984 LISP Conference submissions deadline moved back
Because of delays that occurred in getting out the call for papers,
the deadline for submissions to the 1984 ACM Symposium on LISP and
Functional Programming (to be held August 5-8, 1984) has been moved
back from February 6 to February 15. The date for notification of
acceptance or rejection of papers is now March 20 (was March 12).
The date for return of camera-ready copy is now May 20 (was May 15).
Please forward this message to anyone who may find it of interest.
--Thanks,
Guy L. Steele Jr.
Program Chairman, 1984 ACM S. on L. and F.P.
Tartan Laboratories Incorporated
477 Melwood Avenue
Pittsburgh, Pennsylvania 15213
(412)621-2210
------------------------------
Date: 31 Jan 84 19:54:56-PST (Tue)
From: pur-ee!uiucdcs!ccvaxa!lipp @ Ucb-Vax
Subject: Cybernetics Congress - (nf)
Article-I.D.: uiucdcs.5284
6th International Congress of the World Organisation
of General Systems and Cybernetics
10--14 September 1984
Paris, France
This transdisciplinary congress will present the contemporary aspects
of cybernetics and of systems, and examine their different currents.
The proposed topics include both methods and domains of cybernetics
and systems:
1) foundations, epistemology, analogy, modelisation, general methods
of systems, history of cybernetics and systems science ideas.
2) information, organisation, morphogenesis, self-reference, autonomy.
3) dynamic systems, complex systems, fuzzy systems.
4) physico-chemical systems.
5) technical systems: automatics, simulation, robotics, artificial
intelligence, learning.
6) biological systems: ontogenesis, physiology, systemic therapy,
neurocybernetics, ethology, ecology.
7) human and social systems: economics, development, anthropology,
management, education, planification.
For further information:
WOGSC
Comite de lecture
AFCET
156, Bld. Pereire
F 75017 Paris, France
Those who want to attend the congress are urged to register by writing
to AFCET, at the above address, as soon as possible.
------------------------------
End of AIList Digest
********************
