Re: [aima-talk] Re: Question
- just use the :continue 0 (ignore and rename i think)
on the prompt when you get this error.
--- reggie@... wrote:
It turns out that Franz ships Allegro 6.0 Tral version
in non ANSI<BR>
mode with respect to case sensitivity. There is a
readme.txt in the<BR>
distribution directory describing how to build an ANSI
image. From what little I understand, the CD has
images on it and you should determin which one has the
case set to<BR>
In addition in utilities.lisp the macro WHILE is
defined which is<BR>
already defined in Allegro. Also in the macro deletef
should be changed to get-setf-expansion.<BR>
--- In aima-talk@y..., mbunirigo@y... wrote:<BR>
> Hello, I'm a studen at Buenos Aires University,Argentina<BR>
> I've installed Alegro CL 6.0 to use AIMA
> <BR>shows me this error<BR>
> I have a the following problem: <BR>
> when I tried to load aima.lisp, Alegro CL 6.0
> <BR>the name WHILE as a <BR>
> Error: Attempt to make a FUNCTION definition for
> MACRO. This name is in the EXCL package andredefining it is a <BR>
> violation for portable programs. Replacingthe current definition of <BR>
> #<macro WHILE @ #x200260b2> may bedangerous. The package EXCL has <BR>
> PACKAGE-DEFINITION-LOCK set, which causes thesystem to signal this <BR>
> violation.<BR>that Alegro CL 6.0 <BR>
> [condition type: PACKAGE-LOCKED-ERROR]<BR>
> I undestand that Aima package has some functions
> have yet defined.<BR><BR>
> Anybody knows how to solve this problem.<BR>
> Thanks in advance, Mariano Buñirigo<BR>
<!-- |**|begin egp html banner|**| -->
<table border=0 cellspacing=0 cellpadding=2>
<td align=center><font size="-1"
color=#003399><b>Yahoo! Groups Sponsor</b></font></td>
<td align=center width=470><table border=0
cellpadding=0 cellspacing=0><tr><td align=center><font
alt="" width="300" height="250"
<tr><td><img alt="" width=1 height=1
<!-- |**|end egp html banner|**| -->
To unsubscribe from this group, send an email to:<BR>
<tt>Your use of Yahoo! Groups is subject to the <a
*NEW* Yahoo! Messenger for SMS. Now on your ORANGE phone *NEW*
- Respected,my name is bhargav. I have completed my study in Bachelor Of Computer Applicartion.my question is:What the intelligence can create Fellings?
Do you Yahoo!?
The New Yahoo! Search - Faster. Easier. Bingo.
- On Friday 23 May 2003 11:31, bhargav prajapati wrote:
> What the intelligence can create Fellings?It all depends on what you mean by "feelings".
If you extend the question somewhat to "Can purely algorithmic processes
in a system result in the system having feelings", then you get one of
the hot topics of recent philosophy of mind. Important players are Ned
Block, David Chalmers, Thomas Nagel, John Searle, Sidney Shoemaker and,
of course, Daniel Dennett.
Basically, the debate boils down to an unmitigated opposition between
those who believe in (philosophical) Zombies and those who don't.
Zombies in this sense are creatures who behave absolutely
indistinguishable from ordinary people -- but who don't feel anything,
they don't have "qualia" (philo jargon for raw feelings).
So, if you would insist that feelings are something above and beyond
behavior, utterances, predispositions -- that is, things that can be
discernd from a scientific, third-person perspective. And if you
instead claimed that you have privileged, exclusive, first-person
access to "what it's like". Well, then there's no way from algorithmic
process to feelings.
People who favor this big-R Realist view of qualia conceive of the
feelings themselves as something in need of explanation. In my opinion,
this is a futile endeavor. Instead, I side with those (Dennett), who
more or less see our *verbal reports of feelings* as the thing to
explain. Feelings in this sense are (small-r) real, too, as they
obviously have an explanatory role in our mental economy.
Michael Schuerig Not only does lightning not strike
mailto:schuerig@... twice, it usually doesn't strike once.
http://www.schuerig.de/michael/ --Salman Rushdie, "Fury"
- I have a doubt related to "Breadth-first Search". In this strategy you first verify if a node is the goal and, if it is not, you create its children and then verify the next node at the same level. In the worst case, you create the children of all the nodes at a level, except for the last one, which is the goal, that is, b^(d+1)-b nodes. The question is: wouldn't it be better to create the children after all the nodes of a determined level have been verified? What is the advantage of creating nodes that may not be verified? I think it would be useful a brief explanation about this in the book Artificial Intelligence.Jarbas Joaci de Mesquita Sá Junior
I am not sure which edition of the book you have, but in the third edition BFS is modified to test for goal when the node is generated not when expanded. With this, the complexity is O(b^d) instead of O(b^(d+1)). This also implies that no level is generated if the goal is contained in the previous level.
From: Jarbas Joaci <jarbas_joaci@...>
To: "firstname.lastname@example.org" <email@example.com>
Sent: Thursday, September 5, 2013 8:01 PM
Subject: [aima-talk] Question
I have a doubt related to "Breadth-first Search". In this strategy you first verify if a node is the goal and, if it is not, you create its children and then verify the next node at the same level. In the worst case, you create the children of all the nodes at a level, except for the last one, which is the goal, that is, b^(d+1)-b nodes. The question is: wouldn't it be better to create the children after all the nodes of a determined level have been verified? What is the advantage of creating nodes that may not be verified? I think it would be useful a brief explanation about this in the book Artificial Intelligence.Jarbas Joaci de Mesquita Sá Junior