Loading ...
Sorry, an error occurred while loading the content.

Question

Expand Messages
  • mbunirigo@yahoo.com.ar
    Hello, I m a studen at Buenos Aires University, Argentina I ve installed Alegro CL 6.0 to use AIMA package I have a the following problem: when I tried to load
    Message 1 of 7 , Oct 25, 2001
    • 0 Attachment
      Hello, I'm a studen at Buenos Aires University, Argentina

      I've installed Alegro CL 6.0 to use AIMA package

      I have a the following problem:
      when I tried to load aima.lisp, Alegro CL 6.0 shows me this error

      Error: Attempt to make a FUNCTION definition for the name WHILE as a
      MACRO. This name is in the EXCL package and redefining it is a
      violation for portable programs. Replacing the current definition of
      #<macro WHILE @ #x200260b2> may be dangerous. The package EXCL has
      PACKAGE-DEFINITION-LOCK set, which causes the system to signal this
      violation.
      [condition type: PACKAGE-LOCKED-ERROR]

      I undestand that Aima package has some functions that Alegro CL 6.0
      have yet defined.

      Anybody knows how to solve this problem.

      Thanks in advance, Mariano Buñirigo
    • reggie@lambdawerks.org
      It turns out that Franz ships Allegro 6.0 Tral version in non ANSI mode with respect to case sensitivity. There is a readme.txt in the distribution directory
      Message 2 of 7 , Oct 27, 2001
      • 0 Attachment
        It turns out that Franz ships Allegro 6.0 Tral version in non ANSI
        mode with respect to case sensitivity. There is a readme.txt in the
        distribution directory describing how to build an ANSI case compliant
        image. From what little I understand, the CD has several different
        images on it and you should determin which one has the case set to
        case-insensitive-upper.

        In addition in utilities.lisp the macro WHILE is defined which is
        already defined in Allegro. Also in the macro deletef get-setf-method
        should be changed to get-setf-expansion.

        -Reggie


        --- In aima-talk@y..., mbunirigo@y... wrote:
        > Hello, I'm a studen at Buenos Aires University, Argentina
        >
        > I've installed Alegro CL 6.0 to use AIMA package
        >
        > I have a the following problem:
        > when I tried to load aima.lisp, Alegro CL 6.0 shows me this error
        >
        > Error: Attempt to make a FUNCTION definition for the name WHILE as a
        > MACRO. This name is in the EXCL package and redefining it is a
        > violation for portable programs. Replacing the current definition of
        > #<macro WHILE @ #x200260b2> may be dangerous. The package EXCL has
        > PACKAGE-DEFINITION-LOCK set, which causes the system to signal this
        > violation.
        > [condition type: PACKAGE-LOCKED-ERROR]
        >
        > I undestand that Aima package has some functions that Alegro CL 6.0
        > have yet defined.
        >
        > Anybody knows how to solve this problem.
        >
        > Thanks in advance, Mariano Buñirigo
      • Bhaskar Maddala
        just use the :continue 0 (ignore and rename i think) on the prompt when you get this error. ... It turns out that Franz ships Allegro
        Message 3 of 7 , Oct 28, 2001
        • 0 Attachment
          just use the :continue 0 (ignore and rename i think)
          on the prompt when you get this error.

          --- reggie@... wrote:
          <HR>
          <html><body>
          <tt>
          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
          case compliant<BR>
          image. From what little I understand, the CD has
          several different<BR>
          images on it and you should determin which one has the
          case set to<BR>
          case-insensitive-upper.<BR>
          <BR>
          In addition in utilities.lisp the macro WHILE is
          defined which is<BR>
          already defined in Allegro. Also in the macro deletef
          get-setf-method<BR>
          should be changed to get-setf-expansion.<BR>
          <BR>
          -Reggie<BR>
          <BR>
          <BR>
          --- In aima-talk@y..., mbunirigo@y... wrote:<BR>
          > Hello, I'm a studen at Buenos Aires University,
          Argentina<BR>
          > <BR>
          > I've installed Alegro CL 6.0 to use AIMA
          package<BR>
          > <BR>
          > I have a the following problem: <BR>
          > when I tried to load aima.lisp, Alegro CL 6.0
          shows me this error<BR>
          > <BR>
          > Error: Attempt to make a FUNCTION definition for
          the name WHILE as a <BR>
          > MACRO.  This name is in the EXCL package and
          redefining it is a <BR>
          > violation for portable programs.  Replacing
          the current definition of <BR>
          > #<macro WHILE @ #x200260b2> may be
          dangerous.  The package EXCL has <BR>
          > PACKAGE-DEFINITION-LOCK set, which causes the
          system to signal this <BR>
          > violation.<BR>
          > [condition type: PACKAGE-LOCKED-ERROR]<BR>
          > <BR>
          > I undestand that Aima package has some functions
          that Alegro CL 6.0 <BR>
          > have yet defined.<BR>
          > <BR>
          > Anybody knows how to solve this problem.<BR>
          > <BR>
          > Thanks in advance, Mariano Buñirigo<BR>
          <BR>
          </tt>

          <br>

          <!-- |**|begin egp html banner|**| -->

          <table border=0 cellspacing=0 cellpadding=2>
          <tr bgcolor=#FFFFCC>
          <td align=center><font size="-1"
          color=#003399><b>Yahoo! Groups Sponsor</b></font></td>
          </tr>
          <tr bgcolor=#FFFFFF>
          <td align=center width=470><table border=0
          cellpadding=0 cellspacing=0><tr><td align=center><font
          face=arial size=-2>ADVERTISEMENT</font><br><a
          href="http://rd.yahoo.com/M=213858.1650662.3186813.1261774/D=egroupweb/S=1705948923:HM/A=763352/R=0/*http://www.classmates.com/index.tf?s=5085"
          target=_top><img
          src="http://us.a1.yimg.com/us.yimg.com/a/cl/classmates_com2/bll_lrec1.gif"
          alt="" width="300" height="250"
          border="0"></a></td></tr></table></td>
          </tr>
          <tr><td><img alt="" width=1 height=1
          src="http://us.adserver.yahoo.com/l?M=213858.1650662.3186813.1261774/D=egroupmail/S=1705948923:HM/A=763352/rand=336668514"></td></tr>
          </table>

          <!-- |**|end egp html banner|**| -->


          <br>
          <tt>
          To unsubscribe from this group, send an email to:<BR>
          aima-talk-unsubscribe@yahoogroups.com<BR>
          <BR>
          </tt>
          <br>

          <br>
          <tt>Your use of Yahoo! Groups is subject to the <a
          href="http://docs.yahoo.com/info/terms/">Yahoo! Terms
          of Service</a>.</tt>
          </br>

          </body></html>


          ___________________________________________________________________
          *NEW* Yahoo! Messenger for SMS. Now on your ORANGE phone *NEW*
          Visit http://in.mobile.yahoo.com/smsmgr_signin.html
        • bhargav prajapati
          Respected, my name is bhargav. I have completed my study in Bachelor Of Computer Applicartion. my question is: What the intelligence can create Fellings? ...
          Message 4 of 7 , May 23, 2003
          • 0 Attachment
            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.
          • Michael Schuerig
            ... 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
            Message 5 of 7 , May 23, 2003
            • 0 Attachment
              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.

              HTH,
              Michael

              --
              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"
            • Jarbas Joaci
              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
              Message 6 of 7 , Sep 5, 2013
              • 0 Attachment
                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 Junior


              • HB
                Hi, 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.
                Message 7 of 7 , Sep 9, 2013
                • 0 Attachment
                  Hi,
                  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.

                  Regards,

                  H.B.

                  From: Jarbas Joaci <jarbas_joaci@...>
                  To: "aima-talk@yahoogroups.com" <aima-talk@yahoogroups.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 Junior




                Your message has been successfully submitted and would be delivered to recipients shortly.