On 12/1/07, Josiah Worcester <[EMAIL PROTECTED]> wrote: > 1) Every week, the contestmaster shall announce a new task to be implemented > in Brainfuck.
With finite or infinite tape? With Z cells, Z_n cells, or just bounded
Z cells (that go undefined on overflow)? What's the bound?
--
Taral <[EMAIL PROTECTED]>
"Please let me know if there's any further trouble I can give you."
-- Unknown
