Re: Name the thesis: "Formal sentences capture informal ones"
From: |-|erc (H_at_r.c)
Date: 01/30/05
- Next message: LordBeotian: "Re: Name the thesis: "Formal sentences capture informal ones""
- Previous message: Helene.Boucher_at_wanadoo.fr: "Re: Name the thesis: "Formal sentences capture informal ones""
- In reply to: Helene.Boucher_at_wanadoo.fr: "Re: Name the thesis: "Formal sentences capture informal ones""
- Next in thread: Mitch Harris: "Re: Name the thesis: "Formal sentences capture informal ones""
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Sun, 30 Jan 2005 19:04:05 +1000
<Helene.Boucher@wanadoo.fr> wrote in
> I'm sorry, I don't think I understand your reply.
>
> "ll programs, formulas, wff, numbers, sentences...
> all map to some base number OF THE SAME LENGTH AS THAT SENTENCE."
>
> I think what you're saying is that, e.g. in base 2, the Godel number
> coding a sentence has length the length of the sentence. Indeed.
> Still, because a code is being used, the number is in fact exponential
> wrt to the length.
>
And 2OL is exponential aswell.
It doesn't matter what system of representation you use,
a number-string of length L can represent max base^L different formula.
How are you getting a more consise representation of proofs?
You seem to be using a finite alphabet, and concatinating terms to form
an unlimited alphabet. <T10001 T10003 T3332 T100000001>
The higher order of representation comes at a cost of more expensive symbols to encode.
Herc
- Next message: LordBeotian: "Re: Name the thesis: "Formal sentences capture informal ones""
- Previous message: Helene.Boucher_at_wanadoo.fr: "Re: Name the thesis: "Formal sentences capture informal ones""
- In reply to: Helene.Boucher_at_wanadoo.fr: "Re: Name the thesis: "Formal sentences capture informal ones""
- Next in thread: Mitch Harris: "Re: Name the thesis: "Formal sentences capture informal ones""
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|