From: Krekoski Ross (email@example.com)
Date: Sun Jun 22 2008 - 21:15:01 MDT
sorry, misquoted-- I was replying to peter de Blanc's msg and not Mark's.
On Mon, Jun 23, 2008 at 11:11 AM, Krekoski Ross <firstname.lastname@example.org>
> you can describe the complexity of each descendant with the original code
> plus an argument stating the number of iterations the program runs for.
> There is no change in complexity.
> Mark Nuzzolilo wrote:
>>> I'll take a swing at this.
>>> Let's start with the assumption that a machine cannot output a machine of
>>> greater algorithmic complexity.
>> - Peter de Blanc
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:01:03 MDT