Article View: sci.logic
Article #211Re: New Scientist 21 Mar 92
From: Charles R. Martin
Date: Tue, 18 Aug 1992 22:20
Date: Tue, 18 Aug 1992 22:20
20 lines
1592 bytes
1592 bytes
In article <ALTI.92Aug18150326@tanera.dcs.ed.ac.uk> alti@dcs.ed.ac.uk (Thorsten Altenkirch) writes:
Has anybody had a look at Paul Davies article "Is nature
mathematical?". I only browsed over it but I got the impression that
he confuses the questions of undecidability ("1st order logic is
undecidable" [Church]) and incompleteness ("Every consistent extension
of Peano arithmetic is incomplete"[G"odel]). Any comments?
I believe they're very closely connected. See e.g. Chaitin's
Algorithmic Information Theory (Cambridge Tract in Theoretical CS, I
think is the series.)
--
Charles R. Martin/(Charlie)/martinc@cs.unc.edu/(ne crm@cs.duke.edu)
O/Dept. of Computer Science/CB #3175 UNC-CH/Chapel Hill, NC 27599-3175
H/3611 University Dr #13M/Durham, NC 27707/(919) 419 1754
----------------------------------------------------------------------
"I am he who walks the States with a barb'd tongue, questioning every
one I meet,/Who are you that wanted only to be told what you knew
before?/ Who are you that wanted only a book to join you in your
nonsense?" _Leaves of Grass_ xxiii.4.
Technical Details
Message-ID:
<MARTINC.92Aug18182050@grover.cs.unc.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!decwrl!concert!borg!news_server!martincReferences:
<ALTI.92Aug18150326@tanera.dcs.ed.ac.uk>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!decwrl!concert!borg!news_server!martinc From: martinc@grover.cs.unc.edu (Charles R. Martin) Newsgroups: sci.logic Subject: Re: New Scientist 21 Mar 92 Message-ID: <MARTINC.92Aug18182050@grover.cs.unc.edu> Date: 18 Aug 92 22:20:50 GMT References: <ALTI.92Aug18150326@tanera.dcs.ed.ac.uk> Sender: news@cs.unc.edu Organization: UNC Department of Computer Science Lines: 20 In-reply-to: alti@dcs.ed.ac.uk's message of 18 Aug 92 14:03:26 GMT