Re: Algorithmic TOEs vs Nonalgorithmic TOEs

From: <juergen.domain.name.hidden>
Date: Fri, 9 Feb 2001 12:37:43 +0100

> From jamikes.domain.name.hidden Thu Feb 8 23:45:42 2001
> From: "jamikes" <jamikes.domain.name.hidden>

> Dear Jürgen, what you say about TOEs is fine, just one question:
> aren't we supposed to KNOW about everything before we put everything into an
> equation? (algorithmic or not).
> (first: omniscient, then make equation out of 'it').
> John Mikes
> <jamikes.domain.name.hidden>
> "http://pages.prodigy.net/jamikes"


Dear John,

well, even those who don't know everything can look at all possible
alternatives of what that everything might be. Once they realize that
the describable alternatives are restricted, they can derive something
nontrivial from the restrictions.

The algorithmic assumption is that we don't have to consider
nondescribable alternatives. Maybe this assumption is wrong, but then
we could not say anything reasonable anyway, by definition.
So we shouldn't give it up unless evidence forces us.

Juergen
Received on Fri Feb 09 2001 - 03:44:16 PST

This archive was generated by hypermail 2.3.0 : Fri Feb 16 2018 - 13:20:07 PST