I think you are confusing "proving any arbitrary algorithm is formally equivelent to another arbitrary algorithm" with "find an algorithm Y that is more efficient yet formally equivelent to algorithm X". Since we know that there are an infinite number of algorithms that are formally equivelent to any given algorithm the latter isnt such a difficult problem, especially not for a human and not when X is particularly inefficient. Also a lot of optimisation code is pretty simple in principle replacing templates that match a certain pattern with other templates that do the same thing more efficiently, and still there is no guarantee that your compilers optimizations actually work.

I think all you can do is show us what type of regexes you mean, and perhaps we can advise based on that.

---

---

Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!

Titles consisting of a single word are discouraged, and in most cases are disallowed outright.

Read Where should I post X? if you're not absolutely sure you're posting in the right place.

Please read these before you post! —

• How do I compose an effective node title?
• How do I post a question effectively?
• Markup in the Monastery

Posts may use any of the Perl Monks Approved HTML tags:

a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr

You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)

	For:		Use:
	&		&
	<		&lt;
	>		&gt;
	[		&#91;
	]		&#93;

Link using PerlMonks shortcuts! What shortcuts can I use for linking?

See Writeup Formatting Tips and other pages linked from there for more info.