Hi Marty,

On 30 Jun 2009, at 18:57, m.a. wrote:

>
> Bruno,
>            I'm still with you but I seriously wonder how far I can  
> follow.


Well, honestly, if you don't try to answer to the exercises, we will  
never know.
But I can imagine some shyness for doing so.



>
> I have the sort of mind that groups of logical statement and  
> propositions
> cause to simply shut down.


I disagree. You have already prove to me that you can handle such  
propositions. Your problem is that you don't memorize what you  
understand, so, especially after some break, you feel like you could  
shut down.
This just means that you have to work a little more, and to stop  
building negative self-prejudices, which are most of the time self- 
fulfilling.
Now, I obvioulsy cannot ask you to do such a work, as life is rich and  
full of consuming time opportunities, noir can I really provide the  
motivation for doing so.
I appreciate very much your honesty, even if I suspect the reasons are  
bad.



> I am more than willing to accept that your proof
> is consistent and I assume that others on the list will point out  
> flaws if
> there are any.

The problem is that we have discussed it before. The only things which  
remains to be explained is what is a mathematical computation. This is  
not easy, and ask for some familiarity with basic mathematics.


> What I would really appreciate would be a prose explanation
> of the sequence of ideas that lead to the conclusion that physics  
> can emerge
> from and be (in some sense) actualized by math.

My problem is that UDA is exactly that. I get the AUDA in the early  
seventies, before UDA. And I have developed UDA in the late seventies,  
so as to provide some help for my friends. Since then I know that UDA  
is not so simple, especially the seventh and eighth steps. I can think  
about making a shorter attempt.



> If Kim and others wish to
> continue the exposition of UDA, I'll try to keep up, but I won't ask  
> you to
> continue solely on my account. Best wishes,




No problem Marty, at least you have tried. Kim? how do you do?  
Johnathan?

I know that to play the "candid" role in a public way, you need some  
courage, and it is OK to remain silent. But people have to understand  
than on those delicate matters, it is not really possible to proceed  
without asking question/exercise. We can only continue "the seven step  
series" thread if people provide answer to the exercises.
I will nevertheless try to explain things in a more "journalistic",  
and shorter, way. The problem is that such a thing can easily be  
misinterpreted. I will think about it. The "real thing" is more easy  
to explain, but admittedly longer when we start from quasi zero.

Bruno







>
> ----- Original Message -----
> From: "Bruno Marchal" <marc...@ulb.ac.be>
> To: <everything-list@googlegroups.com>
> Sent: Tuesday, June 30, 2009 6:45 AM
> Subject: Re: The seven step series
>
>
>
> Hi Johnathan,
>
>
> On 29 Jun 2009, at 17:22, Johnathan Corgan wrote:
>
>>
>> Bruno,
>>
>> I think you were off to a good start with your planned series of  
>> posts
>> about the seven step argument.  I believe your first installment  
>> was a
>> discussion of set theory as one of the mathematical preliminaries to
>> the
>> actual argument.
>>
>> I am looking forward to your next installment.
>
>
> Well, thanks. I am not sure Kim and Marty are there, but I can provide
> a summary, and recall the motivation.
>
> Marty, did you come back from holiday? Kim? still interested in
> electronical summer's school on mathematics.
>
> The goal of the seven step thread is to make clear the seventh step of
> the UDA (Universal Dovetailer Argument). The purpose of the UDA is to
> make clear that the mind-body problem (or the consciousness/reality
> problem, or the first person/third person) problem is reduced, when we
> do the computationalist assumption, to a pure body appearance or
> discourse problem. UDA shows that if we assume the comp. hyp. then we
> have to explain the appearance of matter from machine or number self-
> reference only. The proof is constructive, it shows *how* the laws of
> physics have to be extracted from self-reference.
>
> Later, much later, I could explain, if everyone is OK with UDA, how we
> can already extract from self-reference the general shape of physics,
> so that we can already refute empirically, or confirm, the comp. hyp.
> And it appears that the empirical quantum mechanics,  currently,
> confirms the comp. hyp. Quantum mechanics confirms the partial
> indetermination of the outcomes of our possible experiences, and the
> "high non booleanity" of the propositions describing those outcomes".
>
> The object of the "seventh step thread' consists in making the seventh
> step accessible to non mathematicians. So we have to start from zero.
> I have decided to start from elementary "naive" set theory, without
> which we cannot do anything in math. I will avoid all special
> mathematical symbols, and use instead words with capital letters.
>
> We have not yet done a lot. So I can sum up, with the new "notations".
>
> Definition. A set is just a "many" considered, when clear enough, as a
> "one". So a set is just a collection of objects, and those objects are
> called the element, or the member, of the set. If some x is an element
> of some set A, we write x BELONGS-TO A, or (x BELONGS-TO A).
> A set can be described in extension or in intension. "in extension"
> means that we give all elements of the set, enclosed in accolades.
> When the set is not to complex (meaning big or infinite), we can use
> the "...". We can give name to a set, to ease or talk about that set,
> like we do all the times in mathematics. Most of the set we will
> consider are set of mathematical object, mainly numbers in the
> beginning, and then set of ... sets.
>
> Example-exercise:
>
> 1°) Let A be the set {0, 1, 2, 3}. ("A" is said to be a local name for
> the set {0, 1, 2, 3}. And local means that such a name is used in a
> local context. One paragraph later "A" could designed another, so be
> careful). If "A" names {0, 1, 2, 3}, we will write "A = {0, 1, 2, 3}".
>
> OK, so with A = {0, 1, 2, 3}. Which of the following propositions are
> true
>
> 1) the number 2 is a member of A
> 2) the number 12 is a member of A
> 3) the number 12 is not a member of A
> 4) (3 BELONGS-TO A)
> 5) all members of A are numbers
> 6) one element of A is not a number
> 7) A can be defined in intension in the following way A = {x SUCH-THAT
> x is a positive integer little than 4}
>
> 2°) Same questions with the set A = {0, 1, 2, 3, ... , 61, 62, 63}
>
> This makes 14 exercises, which should be easy. I intent to keep it
> that way. I continue after I get either answers (correct or wrong), or
> questions.
>
> Everyone is welcome to participate. Yet, I ask those who are quick to
> respect those who are slow. To be slow in the beginning usually help
> for being deep in the sequel.
>
> Best,
>
> Bruno
>
> http://iridia.ulb.ac.be/~marchal/
>
>
>
>
>
>
> >

http://iridia.ulb.ac.be/~marchal/




--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups 
"Everything List" group.
To post to this group, send email to everything-list@googlegroups.com
To unsubscribe from this group, send email to 
everything-list+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/everything-list?hl=en
-~----------~----~----~----~------~----~------~--~---

Reply via email to