LispForum

Thanks a lot for your help wvxvw!

Hi! consider: (defstruct A left right) (setf i (make-a) j (make-a :left i)) at this point >j #S(A :LEFT #S(A :LEFT NIL :RIGHT NIL) :RIGHT NIL) now obviously adding (setf (a-right i) j) will result in a stack overflow,since >j #S(A :LEFT #S(A :LEFT NIL :RIGHT #S(A :LEFT #S(A :LEFT NIL :RIGHT ..... an...

thanks a lot guys.i hadn't noticed the proof sketch on wikipedia.It needed more creativity than i thought(i'm talking about the definition of the parity function). Anyhow,i still think it's a bit odd that the authors of the book easily mention that without any allusion to any proof,while they tend t...

Hi guys!a math question: i've spent lots of hours trying to figure it out,so if it seems easy,i'm just dumb not lazy^^ anyhow: i'm reading the artificial intelligence book by russel and norvig,where the 8 puzzle is described as the usual 3*3 board with 8 numbered tiles and an empty cell... the autho...

Thx a lot!i'll start reading those right now!

Hi guys! i'm a total noob at lisp,so please excuse me if you find those questions dumb: i conclude from the code below that '(1 . 2) just makes one single cons with its car pointing to 1 and its cdr pointing to 2, while '(1 2) will create a list of two cons,with their car respectively pointing to 1 ...