Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!think.com!snorkelwacker.mit.edu!bloom-beacon!eru!hagbard!sunic!mcsun!ukc!warwick!nott-cs!ucl-cs!news
From: G.Joly@cs.ucl.ac.uk (Gordon Joly)
Newsgroups: comp.ai.philosophy
Subject: Re: What is `maximal clique' technique? - RESPOST
Message-ID: <1288@ucl-cs.uucp>
Date: 15 Nov 90 09:47:37 GMT
Sender: news@cs.ucl.ac.uk
Lines: 11


Note in passing that Penrose discusses a related topic (to cliques )
in "The Emperor's New Mind". In the chapter titled "Truth, Proof and
Insight" he reviews, P, NP and NP-completeness, and give as an example
(in graph theory), the complexity theory concerned with a Hamiltonian
circuit.


Gordon Joly                                           +44 71 387 7050 ext 3716
InterNet: G.Joly@cs.ucl.ac.uk       UUCP: ...!{uunet.uu.net,ukc}!ucl-cs!G.Joly
Computer Science, University College London, Gower Street, LONDON WC1E 6BT, UK