Re: Self-recognizing programs and regular expressions

On Tue, Mar 08, 2005 at 14:19 +1300, Jasvir Nagra wrote:
> Sorry. 255^2 * 8^17.  And now with Karsten Sperling correction for $
> 255^2 * 8^17 * 2.

So we have 

^.[\\[\]{}17.]{17}.$		255^2 * 8^17 * 2 292846565769766502400

Before reading the other solutions I had a similiar idea:

^[][{}19^\\\$]{19}$		        9^19 * 2   2701703435345984178

combining this solution with the first one, we arrive at the following
two

^.[][{}15.]{15}.$		255^2 * 7^15 * 2    617420374368087150
^[][{}16^.]{16}.$		255   * 8^16 * 2    143552238122434560

still they are all much worse than the simple

^.{6}$				255^6        * 2       549883993781250

CU,
    Sec
-- 
The Feynman problem solving Algorithm
			1) Write down the problem
			2) Think real hard
			3) Write down the answer

-----BEGIN PGP SIGNATURE-----

iD8DBQFCLXvxuG8KNKueMhMRAtN6AJ4rzBqLYnVFAgw1tazatAxTDtSy+QCfT5m5
f+o6nOEBqBkQ72FQsdB4sxw=
=co4K
-----END PGP SIGNATURE-----