Re: [sl4] Is belief in immortality computable?

From: John K Clark (johnkclark@fastmail.fm)
Date: Tue May 26 2009 - 13:21:52 MDT


On Tue, 26 May 2009 "Tomaz Kristan"
<kristan@scientist.com> said:

> Say, that you have a nonprovable theorem.

But there is in general there is no way to know it’s unprovable.

> You may add it to your list as another axiom.

Tou could, but if you can’t prove it then you don’t know if it’s true,
adding it as a axiom is very dangerous. Suppose you add as an axiom that
Goldbach’s Conjecture is true and then somebody crunching numbers on a
computer find’s a counterexample to prove it false? Mathematics would
collapse.

 John K Clark

-- 
  John K Clark
  johnkclark@fastmail.fm
-- 
http://www.fastmail.fm - Access your email from home and the web


This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:01:04 MDT