In article <OI5Ae.141460$zX6.7309433_at_phobos.telenet-ops.be>,
jan.hidders_at_REMOVETHIS.pandora.be says...
> Come on, Jon. How much tape does the Turing machine need that computes
> this transformation if n is the size of the input?
Apparently, there are holes in my education---I'm more an engineer than
a scientist. The complexity I'm used to computing on algorithms deals
with time or number of operations; both the set and string algorithms
seem linear to me. But if you won't bother to explain, no big deal. I
still say both operations are trivial to perform. And why draw the line
at that particular place?
--
Jon
Received on Sun Jul 10 2005 - 12:21:56 CDT
