Re: similar to godel numbering

From: Rich Koup (richkoup_at_hotmail.com)
Date: 01/22/05 

Date: Sat, 22 Jan 2005 03:48:47 -0500

For example:

for the series [12,6,14,8,4]

2^12 + 3^6 + 5^14 + 7^8 + 11^4 = large number

Is there any other mathematical coding technique that can give a smaller
number, rather than a large number as the above example shows?

Thanks

"Timothy Little" <tim-via-n.i.net@little-possums.net> wrote in message
news:slrncv4432.12j.tim-via-n.i.net@soprano.little-possums.net...
> Rich Koup wrote:
> > My main priority is to have smaller numbers than the ones outputed
> > by Godel's numbering. The smaller the value of the result, the
> > sweeter it is.
>
> Smaller for what input? IIRC, Godel numbering for a sequence of
> natural numbers n_i was
> Product p_i^(n_i), where p_i is the i'th prime.
>
> There isn't a mapping that gives smaller numbers in general. All you
> can do is choose which sequences get smaller numbers.
>
>
> - Tim