Re: A calculus of personal identity

From: Bruno Marchal <>
Date: Sat, 24 Jun 2006 16:06:29 +0200

Le 21-juin-06, à 11:19, Russell Standish a écrit :

> On Thu, Jun 22, 2006 at 10:29:30PM -0700, George Levy wrote:
>> In Bruno's calculus what are the invariances? (Comment on Tom
>> Caylor's post)
> The main one relates to universal computation. For example, the coding
> theorem states that complexity measures will differ by at most a
> constant, regardless of which UTM you use.

Indeed. And then theoretical computer science is full of quite
fundamental fixed point theorems, which provides invariants for the
(total or partial) computable transformations. Eventually (who knows?)
I will show how diagonalization provides such invariants. For example,
when you apply any program to a universal sequence of programs (like
those computing the Fi), there is always a program which behavior (=
input-output) remains unchanged. This will be a key to introduce the
notion of self-reference for machines.


You received this message because you are subscribed to the Google Groups "Everything List" group.
To post to this group, send email to
To unsubscribe from this group, send email to
For more options, visit this group at
Received on Sat Jun 24 2006 - 10:07:32 PDT

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