Xref: utzoo comp.ai:6969 comp.lang.lisp:3271
Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!yale!mintaka!bloom-beacon!eru!luth!sunic!mcsun!ukc!strath-cs!cs.glasgow.ac.uk!jack
From: jack@cs.glasgow.ac.uk (Jack Campin)
Newsgroups: comp.ai,comp.lang.lisp
Subject: Re: Help.Goedel.Lisp
Message-ID: <5415@vanuata.cs.glasgow.ac.uk>
Date: 6 Jun 90 14:36:36 GMT
References: <30992@ut-emx.UUCP>
Reply-To: jack@cs.glasgow.ac.uk (Jack Campin)
Organization: COMANDOS Project, Glesga Yoonie, Unthank
Lines: 20
Summary:
Expires:
Sender:
Followup-To:
Keywords:


koen@ut-emx.UUCP ( Billy Koen) wrote:

> 	During the mid-60Us at MIT, one of our professors (Minsky? Bobrow?)
> ask us to demonstrate/prove GoedelUs Proof in Lisp.  Now three decades
> later I would like to use it in the class room, but cannot remember the
> exact problem statement or the demonstation.

Dunno about that one, but there is an explicit proof of Godel's theorem
using Lisp in Gregory Chaitin's "Algorithmic Information Theory" (Cambridge
University Press).  It's a long way from Godel's own proof, though.

[ Incidentally, take your terminal emulator outside and shoot it. That was
  possibly the nastiest formatting I've ever seen in a Usenet article. ]

-- 
--  Jack Campin   Computing Science Department, Glasgow University, 17 Lilybank
Gardens, Glasgow G12 8QQ, Scotland   041 339 8855 x6044 work  041 556 1878 home
JANET: jack@cs.glasgow.ac.uk    BANG!net: via mcvax and ukc   FAX: 041 330 4913
INTERNET: via nsfnet-relay.ac.uk   BITNET: via UKACRL   UUCP: jack@glasgow.uucp