Re: Self-recognizing programs and regular expressions
[email protected] (Jasvir Nagra)
| Newsgroups | perl.fwp |
|---|---|
| Message-ID | <1110241228.15517.78.camel@stoic> |
Nice! In my first draft of the problem I had specifically disallowed infinitely long strings (afterall "print "print "print ... is not a valid quine) but I must have foolishly dropped it in one of the revisions. I'll accept infinitely long solutions as soon as we have a cpan module that allows infinitely long regex. :) On Mon, 2005-03-07 at 23:05 +0000, Ton Hospel wrote: > Ah, the idea seems salvagable, but less elegant: > > this sequence is self matching: > ^ > ^\^ > ^\^\\\^ > ^\^\\\^\\\\\\\^ > .... > > so an infinite sequence of ^ with 2**n-1 \ after the n-th ^ -- Jasvir Nagra http://www.cs.auckland.ac.nz/~jas
signature.asc
(application/pgp-signature, 189 B)
-----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.4 (GNU/Linux) iD8DBQBCLO/Mv/AoArEwaEgRAjjzAJ4pjv73uazaRV6hPceYkG8giRLPxQCfZuII +b7qHZOG6BpF8xa4cwO17Gc= =CS3x -----END PGP SIGNATURE-----