"Computability and Unsolvability" by Martin Davis* has an interesting recursive element.
Part of the discussion in the book is about recursive functions -- fairynuff. After the book was first published, Davis wrote an article for Scientific American on an element of the topic. The article, as they do in Scientific American, includes a bibliography. In the bibliography to the article Davis incldued the book. Then a revised edition of the book was published. With his Scientific American article as an appendix. So the book now contains a bibliography that includes the book itself as an entry in the bibliography.
(Niggle: I could have said "almost includes" in that last sentence, but as the "current" book isn't being sold or flagged as a second edition.)
A recursion once again
(Anonymous) 2004-12-10 07:37 pm (UTC)(link)Part of the discussion in the book is about recursive functions -- fairynuff. After the book was first published, Davis wrote an article for Scientific American on an element of the topic. The article, as they do in Scientific American, includes a bibliography. In the bibliography to the article Davis incldued the book. Then a revised edition of the book was published. With his Scientific American article as an appendix. So the book now contains a bibliography that includes the book itself as an entry in the bibliography.
(Niggle: I could have said "almost includes" in that last sentence, but as the "current" book isn't being sold or flagged as a second edition.)
*http://www.amazon.co.uk/exec/obidos/ASIN/0486614719/ref=ase_wwwlink-software-21/202-9244329-6954200
no subject
no subject
no subject
no subject