HDTenEightyP/NetNews huggingface dataset:
From: choy@skorpio.usask.ca (I am a terminator.)
Subject: Re: measuring complexity (was Re: Kolmogorov Complexity)
Organization: University of Saskatchewan, Saskatoon, Canada
Date: Wed, 19 Aug 1992 22:34:52 GMT

In article <1992Aug13.033835.4492@linus.mitre.org>, crawford@church.mitre.org (Randy Crawford) writes:
|> In article <1992Aug12.173546.3298@access.usask.ca> choy@skorpio.usask.ca (I am a terminator.) writes:
|> >In article <arms.713549466@spedden>, arms@cs.UAlberta.CA (Bill Armstrong) writes:
|> >|> The trouble is that all you need to define any function is a
|> >|> (complete) table of input-output pairs.  If you allow this table as
|> >|> (part of) the "instruction set", all of computability theory becomes
|> >|> uninteresting.  So yes, normally algorithms have to be finite.
|> >
|> > Why would computability theory become uninteresting?
|> 
|> Because any machine may be made arbitrarily powerful (that is, of less or equal
|> power to the original machine) by passing it more or less complex input (instr-
|> uctions).  In evaluating the machine as an interpreter of the instructions,
|> you are measuring the complexity of the input which the modified machine will
|> recognize, and not the complexity of the machine itself.  The arguments will
|> direct the interpreting machine to behave like a different machine.  Therefore 
|> stack machines may become finite-state machines, and turing machines may become
|> _any_ kind of machine.
|> 
|> This is not so different from the undecidability problem.  If you pass arguments
|> into a machine which direct the machine to act like a different machine, not
|> only can you not decide whether the original machine terminates for all input, 
|> but the new machine no longer behaves with the same level of complexity or
|> power that it did before the instructions were introduced.
|> 
|> That begs a question.  Are all universal turing machines of indeterminate 
|> power?  Or must they be considered turing machines because they _may_ be 
|> configured as turing machines, even though they also may not be so configured?
|> If they _are_ still turing machines, then once again, why does computibility 
|> theory become uninteresting once a turing machine is passed instructions?
|> 
|> (Do I detect a bit of circular reasoning here...)
|> 
|> 
|> Randy
|> crawford@mitre.org
|> -- 
|> 
|> | Randy Crawford        crawford@mitre.org        The MITRE Corporation
|> |                                                 7925 Colshire Dr., MS Z421
|> | N=1 -> P=NP           703 883-7940              McLean, VA  22102

If infinite programs are allowed, then infinitely large functions can be
enumerated (the elements or pairs of the function can be listed) by running
the program on each function input or member of the domain.

Henry Choy
choy@cs.usask.ca

N = nuclear
P = power

P < NP since mere power < nuclear power

Newsgroups: comp.ai.neural-nets
From: mpp@cns.brown.edu (Michael P. Perrone)
Subject: Re: Reducing Training time vs Generalisation
Keywords: back propagation, training, generalisation
Organization: Center for Neural Science, Brown University
Date: Tue, 18 Aug 1992 23:16:50 GMT

The example given of a "wild" solution to a backprop problem
( f(x) = 40 [ 1/( 1 + e^40*(x - 1/4))  +   1/( 1 + e^-40*(x - 3/4))  -1 ] )
is certainly a valid solution.  But whether gradient descent from an
initially "well-behaved" f(x) (e.g. one with suitable bounded derivatives)
would fall into the "wild" local minima is not clear. 

This example is more on the lines of an existence proof than a 
constructive proof:  Wild minima can exist but is gradient descent
likely to converge to them?
Newsgroups: comp.ai.neural-nets
From: arms@cs.UAlberta.CA (Bill Armstrong)
Subject: Re: Reducing Training time vs Generalisation
Keywords: back propagation, training, generalisation
Organization: University of Alberta, Edmonton, Canada
Date: Wed, 19 Aug 1992 08:52:33 GMT

mpp@cns.brown.edu (Michael P. Perrone) writes:

>The example given of a "wild" solution to a backprop problem
>( f(x) = 40 [ 1/( 1 + e^40*(x - 1/4))  +   1/( 1 + e^-40*(x - 3/4))  -1 ] )
>is certainly a valid solution.  But whether gradient descent from an
>initially "well-behaved" f(x) (e.g. one with suitable bounded derivatives)
>would fall into the "wild" local minima is not clear. 

It is an absolute minimum, not a local minimum.

>This example is more on the lines of an existence proof than a 
>constructive proof:  Wild minima can exist but is gradient descent
>likely to converge to them?

Why don't you try it?  The problem is trivial, easy to set it up. I
have done it it does converge.
--
***************************************************
Prof. William W. Armstrong, Computing Science Dept.
University of Alberta; Edmonton, Alberta, Canada T6G 2H1
arms@cs.ualberta.ca Tel(403)492 2374 FAX 492 1071
Newsgroups: comp.ai.neural-nets
From: hovila@jyu.fi (Ari Hovila)
Subject: Help: references for using NNs in control and optimization
Organization: University of Jyvaskyla, Finland
Date: Fri, 21 Aug 1992 06:57:38 GMT


Hello netters,

I'm interested in using ANN-models for *control*and*optimization*
(both statical and dynamical cases).

I'm short of material though and finding references seems like a 
difficult task so I would be very grateful for any books/articles/other
references related to these issues.

Please, reply by e-mail. I'll summarize.

---Ari Hovila, hovila@jyu.fi
---University of Jyvaskyla
From: kandt@ai-titania.JPL.NASA.GOV (kirk kandt)
Newsgroups: comp.ai
Subject: Re: Demon
Keywords: demon
Date: 14 Aug 92 21:27:28 GMT
Organization: NASA/JPL

In article <92Aug14.120610edt.300@smoke.cs.toronto.edu>, gh@cs.toronto.edu (Graeme Hirst) writes:
|> In article <1992Aug14.055751.29529@unixg.ubc.ca> xie@unixg.ubc.ca (Linchi Xie) writes:
|> >Can somebody tell me why an attached procedure in AI is called 'demon'?
|> >Who coined the word?
|> 
|> 
|> So in AI, an attached procedure is like a little demon that pops up at
|> the right time to look after something; rather a nice metaphor.  I
|> believe Eugene Charniak was the first to use it, in his dissertation,
|> 1972.
|> 
|> -- 

An attached procedure and demon are not the same thing although many, if not most,
people confuse the two.  A demon is separate from a slot of a frame, which is
where an attached procedure resides.  A demon has an associated pattern which
is applied when a database update is performed.  If the pattern matches then a 
procedure is invoked.  The pattern may easily test multiple objects whereas an
attached procedure has greater problems coordinating several objects.

The first use of demon which I am familiar is in the Planner languages.  Papers
on it appeared around 1967-1969 by Hewitt, McDermott, and others.  The QA4 
language was also being developed at about the same time by Reboh and others.

I'd provide more info if I didn't have a broken shoulder and ribs which
make typing very difficult.

-- 
	 |^^^^^^|  The Official Dirt Riders Motto...
	 |      |  (According to Bart, that is)
	 |      |
	 | (o)(o)     _____________________________
	 @      _) _ /  Pain is temporary,         |  Kirk Kandt
	  | ,___| /__   Bones heal,                |  M/S 525-3660
	  |   /      \  Chicks dig scars &         |  Jet Propulsion Laboratory
	  /___\       \ Glory is forever!!!        |  4800 Oak Grove Drive
	 /     \       \___________________________|  Pasadena, CA 91109
From: xie@unixg.ubc.ca (Linchi Xie)
Subject: Demon
Keywords:  demon
Organization: University of British Columbia, Vancouver, B.C., Canada
Date: Fri, 14 Aug 1992 05:57:51 GMT


Can somebody tell me why an attached procedure in AI is called 'demon'?
Who coined the word?

--
Linchi Xie                  
Faculty of Commerce                   |   xie@unixg.ubc.ca
University of British Columbia        |   linchi_xie@mtsg.ubc.ca
Vancouver, B.C., CANADA V6T 1Z2
From: trudel@dragon.acadiau.ca (Andre Trudel)
Newsgroups: comp.ai
Subject: email address for Fariba Sadri
Date: 13 Aug 92 16:42:25 GMT
Organization: Acadia University


I'd like to send email to Fariba Sadri who was (and may still be)
at Imperial College in the late 80's. Would anyone have an
email address for Fariba?

Andre Trudel
trudel@acadiau.ca
From: cwng@troi.cc.rochester.edu (Chuan Wang)
Newsgroups: comp.ai
Subject: Looking for information source about GENETIC ALGORITHMS
Date: 20 Aug 92 13:19:47 GMT
Organization: University of Rochester (Rochester, NY)

Hi, can anyone tell me if there is some newsgroup or e-mail information source
about GENETIC ALGORITHMS and its applications ? I think that there is going to 
be an international conference of GA some time in 1993, can anyone give me
some information about that ?

Many thanks in advance,

C.W.
From: Vision-List-Request@ADS.COM (Vision-List moderator Phil Kahn)
Newsgroups: comp.ai.vision
Subject: VISION-LIST digest 11.29
Date: 20 Aug 92 19:39:20 GMT
Reply-To: Vision-List@ads.com
Distribution: inet
Organization: The Internet


MAIL DELETED BECAUSE OF LACK OF DISK SPACE
From: mjb@netcom.com (Martin Brown)
Subject: Re: genetic algorithm
Date: Mon, 17 Aug 92 15:34:51 GMT
Organization: Netcom - Online Communication Services (408 241-9760 guest)
Keywords: GA, Lit, Software, GA-Digest

For introductory genetic algorithm info, see "Scientific American" magazine
July 1992.  For GA and associated artificial life info, you may want to get
"Artificial Life" and "Artificial Life II", edited by Christopher G. Langton,
which are the proceedings of the first two ALife conferences in Santa Fe,
New Mexico.  Also, there is the introductory "Artificial Life" by Steven Levy,
which came out this past spring(?).
-- 

                                   - mjb -

                                mjb@netcom.com
From: danny@ponder.csci.unt.edu (Danny Faught)
Subject: Re: Proposed FAQ for comp.ai
Summary: cool!
Organization: University of North Texas, Denton
Date: Thu, 20 Aug 1992 21:33:01 GMT

Yeah!  Does this mean AI is now a real topic?  :-)
-- 
Danny Faught    danny@ponder.csci.unt.edu
Save this sig - I'll be famous someday
From: nslard%Solomon.Technet.sg (Joseph Yong Soon Kyun)
Subject: Re: Classes Suggestions
Organization: National University of Singapore
X-Newsreader: Tin 1.1 PL5
Date: Wed, 19 Aug 1992 09:11:40 GMT

Aaron R Wininger (arw4@cunixb.cc.columbia.edu) wrote:
: I'm an undergrad Applied Physics major and have become extremely interested
: in AI and expert systems (mainly as a result of reading too much sci-fi like
: Hyperion and Nueromancer). Anyway, if somebody could suggest (generally) what
: languages and courses (Applied Math, Comp Sci) (allready know Fortran,Basic)
: would be helpful, I would appreciate it.
: Thanks in advance.
: Aaron
: 
: Aaron R. Wininger, Carnivore                 Columbia Plasma Physics Laboratory
: arw4@cunixb.cc.columbia.edu                                 Columbia University
: wininger@cuplvx.ap.columbia.edu                              New York, NY 10027
:       'That which does not kill us, makes us stronger.'  -Nietzche
From: ski@kayak.tc-suns (Chris Kacoroski,none)
Newsgroups: comp.ai
Subject: Info request on validating truth maintenance systems
Keywords: truth maintenance, validation, verification
Date: 12 Aug 92 17:53:42 GMT
Reply-To: ski@kayak.tc-suns
Organization: Sun Microsystems

Hi,

I need any information you can provide on validating truth
maintenance systems.  Thanks for your time.


Cheers,

Chris "ski" Kacoroski	"When we try to pick out anything by itself
ski@atc.boeing.com	 we find it connected to the entire universe"
							John Muir
Newsgroups: comp.ai,comp.theory.self-org-sys
From: yil@engr.ucf.edu (Yilmaz Cengeloglu)
Newsgroups: comp.ai
Subject: HELP: Automated Air Traffic Controlling and Blackboard System
Date: 14 Aug 92 18:22:05 GMT
Article-I.D.: cs.1992Aug14.182205.5425
Organization: engineering, University of Central Florida, Orlando



Hi :

I have asked help about Blackboard Architecture couple of months ago.
I have received some responses. Thanks to everyone who helped me. I have
the list of several references related with BBA. If any anyone needs please 
let me know. 

Currently I am still working on my project for my thesis and I neen some more
help. I am explaining what I need first. If you are interested what I am doing
you can continue to read after line. 

I will write simple knowledge bases to solve the conflict and other problems that
occurs at airspace. I do need some help to complete this project and graduate.

	If you know any publication related with
			- Automated Air Traffic Controlling,
			- books that I can get expertise to write knowledge bases       
			  to solve the problems at airspace.
			- Blackbard Systems AND Air Traffic Controlling. 

 	 please let me know. I will keep all information that I will receive
         and I will send anyone request later. 
											  

	  If you know any existing system, project, company related with
	  Automated Air traffic controlling, please let me know. It will
	  be very helpful for my project.

				                           Yilmaz Cengeloglu
				                           Univ. of Central Florida
							   Dept. of Computer Eng. 
							   Orlando, FL    

				                           yilmaz@ists.engr.ucf.edu
							          or
							   yil@engr.ucf.edu


---------------------------------------------------------------------------------

I am preparing prototype Automated Air Traffic Controlling (A-ATC) system to 
prepare and test knowledge bases for each plane in the airspace. I did need a Blackboard
shell for my project. Only commercial system that I found was GBB that marketed by 

Blackboard Technology Group, Inc.;
401 Main St., Amherst, MA  01002, 413/256-8990,
fax: 413/256-3179.

Their price was too high for me to buy as a graduate Student. I have implemented my 
own Blackboard System on SunOS operating system. ( I am not really sure if I should
call Blackboard System.) Different knowledge bases in CLIPS working as a different 
process on the background and uses Blackboard when it is necessary to share fact with 
other knowledge sources. Of course, any other process in C, C++, etc can access the
Blackboard. The type of architecture is easy to distribute more than one computer
using computers networks. If I would continue the project after I got my M.S.
I am still testing it.  

Also, I did implemented a Radar Simulator Using C/C++, X-Windows and IPC facilities
on the SunOS operating system.  Radar simulator is being used by Intelligent Simulation
and Training systems Project at UCF.

A-ATC project is integration of Radar Simulator and Blackboard System.
From: robert@cogsci.ed.ac.uk (Robert Inder)
Newsgroups: comp.ai
Subject: Re: Cyc
Date: 12 Aug 92 10:26:50 GMT
	<1992Aug10.185806.24000@cs.yale.edu>
Organization: Centre for Cognitive Science, University of Edinburgh
In-reply-to: mcdermott-drew@CS.YALE.EDU's message of 10 Aug 92 18:58:06 GMT

In article <1992Aug10.185806.24000@cs.yale.edu> mcdermott-drew@CS.YALE.EDU (Drew McDermott) writes:

   I have heard of AI's reputation for hype so often that I am finally
   moved to ask, just where does this reputation come from? 
I would have said a lot of it comes from the publicity for expert system
tools and other "AI" products.

   There are a few famous quotes from Herb Simon thirty years ago, and some
   unfortunate books by Ed Feigenbaum, but my impression is that the the
   bulk of the hype comes from popularizers and funding agencies.  
...where "popularisers" includes journalists, I assume.

I have vague memories of a steady trickle of articles in the general press
for many years, each predicting some major breakthrough was imminent: "the
robots are coming" or "vision is just around the corner" or "chat to your
friendly bank computer" or "computerised GPs" or whatever.

I have certainly met people who ascribe some kind of omniscience---an
ability to solve any problem, no matter how far beyond beyond conventional
computing, or even human expertise---to any computer program that is "AI"
in some sense.  (This is, of course, silly: everybody knows that the only
way to get computers to solve things that humans cannot is to use neural
nets:-) Where did they get that impression?

   I don't see how the field can be blamed for this phenomenon, unless the
   mere willingness to work on such a flakey area is an endorsement of
   every crazy speculation that anyone has ever indulged in.

Weeellllll....

I suspect that it is hard to get journalists to pass up an exciting angle
on a science story, or to avoid emphasising the attention-grabbing
"ultimate possibility" of a technology.  But doesn't "the field" have to
take some responsibility for not crying "Whoa" loudly enough?

Dunno...


						   -- Drew McDermott
Robert.
--
--------------------------------------------------------------------------
Robert Inder        HCRC, 2, Buccleuch Place, Edinburgh  EH8 9LW Scotland
From: orpheus@reed.edu (P. Hawthorne)
Newsgroups: comp.ai
Subject: A Graph Theory Newsgroup, Perhaps?
Date: 18 Aug 92 08:46:36 GMT
Article-I.D.: reed.1992Aug18.084636.26478
Organization: Reed College, Portland OR


  Graph theory is at the heart of so many fields that it is somewhat
obscured by its own versatility.

  I feel that there ought to be a graph theoretic newsgroup, if only for
the insights that such a multidisciplinary newsgroup could offer.

  I'd be interested in hearing from others, to see if a more formal
approach to creating such a newsgroup is warranted.


  Theus (Prometheus Hawthorne - Jones, orpheus@reed.edu)
From: nau@frabjous.cs.umd.edu (Dana Nau)
Newsgroups: comp.ai
Subject: Re: workshop on AI/Manufacturing
Date: 19 Aug 92 00:50:36 GMT
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742
In-reply-to: pat@cs.strath.ac.uk's message of 10 Aug 92 12:14:03 GMT

In article <10141@baird.cs.strath.ac.uk> pat@cs.strath.ac.uk (Pat Prosser) writes:

   From: irrgang@syd.dit.CSIRO.AU (Rosemary Irrgang)
   Is anyone out there interested in a workshop
   on AI in manufacturing for IJCAI 93?
   CSIRO Division of Information Technology (Sydney Australia)
    are keen to support one. Let us know if there is one planned or other
    centres are also interested in the area.

   From: pat@cs.strath.ac.uk (Pat Prosser)
   Is it not the case that the SIGMAN wil organise a w/shop
   on this topic?

Since SIGMAN is an AAAI subgroup, we usually organize workshops at
AAAI rather than IJCAI.  Since we'll be trying to organize one or more
workshops on AI in manufacturing for AAAI-93, I doubt that we'll have
the energy to organize a workshop at IJCAI-93 as well.  However, if
there's enough enthusiasm for doing something at IJCAI-93, then we can
certainly consider it.

		-- Dana Nau (Academic Co-Chair, SIGMAN)
--
	Dana S. Nau
	Computer Science Dept.		Internet:  nau@cs.umd.edu
	University of Maryland		UUCP:  uunet!mimsy!nau
	College Park, MD 20742		Telephone:  (301) 405-2684
From: steve.rainwater@ocitor.fidonet.org (Steve Rainwater)
Sender: FredGate@ocitor.fidonet
From: pazzani@pan.ics.uci.edu (Michael Pazzani)
Newsgroups: comp.ai
Subject: Re: ID3 program available ???
Date: 19 Aug 92 19:48:46 GMT
Article-I.D.: ics.2A92A59E.734
Reply-To: pazzani@ics.uci.edu (Michael Pazzani)
Organization: Univ. of Calif., Irvine, Info. & Computer Sci. Dept.

In article <1992Aug19.070040.5505@nntp.nta.no> styri@nta.no writes:
>In article <pl140048.714175449@academ01>,, Leonardo Garrido writes:
>>
>>I also remember that someone here in comp.ai said that there is a book by
>>Quinlan on C4.5 that is the successor of ID3 (the same author). This is
>>available from Morgan Kaufman. I guess this new algoritm is similar and
>>better that its predeccessor. I guess the book is accompanied by the C code.
>
>I haven't got around to calling Morgan Kaufman yet, but an extensive search
>in lists of published books didn't help me. Either this is a reference to
>a paper in some `readings' book, or it is a `to be published'.
The latest Morgan Kaufmann catalog lists it as published in the fall
of 1992. Call them at 800-745-7323 or send e-mail to morgan@unix.sri.com
Newsgroups: comp.ai
From: bws@ccs.carleton.ca (Brian Sullivan)
Subject: Re: Looking for information source about GENETIC ALGORITHMS
Organization: Carleton University
Date: Thu, 20 Aug 1992 14:30:54 GMT

In article <1992Aug20.131947.26657@galileo.cc.rochester.edu> cwng@troi.cc.rochester.edu (Chuan Wang) writes:

>Hi, can anyone tell me if there is some newsgroup or e-mail information source
>about GENETIC ALGORITHMS and its applications ? I think that there is going to 

AI Expert has done a few articles on GA's in the last 6 month. Feburary's
Genetic/fuzzy article was very interesting. 

I am currently playing with GA's. What gets me is that these things are
so simple, that I can't believe no one thought of them years ago. Or at
least why no one has pushed there applications, particularly in Operations
Research. I mean they blow LP out the door. (Yeah flame me on that).
From: vassilis@sun.pcl.ac.uk (Vassilis Konstantinou)
Newsgroups: comp.ai
Subject: Lecturer post in AI
Date: 14 Aug 92 11:07:21 GMT
Organization: Polytechnic of Central London


             LECTURER POST IN ARTIFICIAL INTELLIGENCE

             AI DIVISION - SCHOOL OF COMPUTER SCIENCE
		  The University of Westminster


Applications are invited for a Lecturer post in AI to support the
expanding AI  Division  in  our  school.  The  division currently
supports, a B.Sc. in AI, an M.Sc. in Cognitive  Science,  and  an
M.Sc. in Knowledge Engineering. The division also includes a very
active AI Research Group.

The  successful  applicant  is  expected  to  contribute  in  the
teaching of the  above  courses  in  one or more of the following
areas:

     a)   Distributed AI/KBS
     b)   Machine Learning
     c)   Scheduling
     d)   AI-related languages (PROLOG, LISP etc)
     e)   Human Computer Interaction
     f)   Natural Language Understanding
     g)   Alternative Logics (Modal, Temporal etc)
     h)   Computer Vision 

The successful applicant is also  expected  to  contribute  in the
research activities of the AI Research Group.

Applicants for this post must possess:

      1)  Postgraduate qualifications (preferably at Ph.D. level)
          in an AI related area.

      2)  Research experience in an AI related area.

Teaching experience will be an advantage.

The post is  temporary  for  one  year  (full-time)  and  will be
reviewed at the end of the one year period.

To apply send an extensive C.V. to:

        V. Konstantinou
        Head of AI Division
        School of Computer Science
	University of Westminster
        115 New Cavendish Str
        London W1M 8JS, UK.

        Tel: 071-911-5000 ext 3599/3598
        Fax: 071-911-5089
        Email:  vassilis@uk.ac.sun.pcl (JANET)
                vassilis@pcl.sun.ac.uk (Internet)


The deadline for applications is the 30th of August 1992.
-- 
--
V. Konstantinou
Head of A.I. Research Group
School of Computer Science, The Polytechnic of Central London
From: fawcett@unix1.cs.umass.edu (Tom Fawcett)
Newsgroups: comp.ai
Subject: Re: Demon
Keywords: demon
Date: 20 Aug 92 22:49:56 GMT
Reply-To: fawcett@unix1.cs.umass.edu (Tom Fawcett)
Organization: University of Massachusetts, Amherst

In article <1992Aug20.164352.23865@wam.umd.edu> kandelin@wam.umd.edu (Dr. Nils A. Kandelin) writes:
>Drew appears to be correct; John V. Jackson mentions the "Pandemonium Theory 
>of Perception" by Oliver Selfridge as using "demons," but no citation is 
>provided for the Selfridge work.

Here's a reference:

auth	Selfridge, O. G.
year	1959
title	Pandemonium:  A paradigm for learning
type	inproc
in 	Proceedings of the Symposium on the Mechanization of Thought Processes
pp	513-526
addr	Teddington, England
pub	National Physical Laboratory, H.M. Stationary Office, London
note	Also published in {\it Computers and Thought},
	edited by Feigenbaum and Feldman.
	New York: McGraw-Hill Book Company, 1963, pp. 251-268.


I imagine _Computers and Thought_ is much more accessible than the original
source. 

Although Selfridge used the term, and may have been the first to use it in AI,
as I recall his 'demons' were more like 'features' in pattern recognition,
rather than attached procedures or constraints.

-Tom
Newsgroups: comp.ai