Since Befunge seems to support random-access storage with the "p" and 
"g" commands, I'd imagine that it should indeed be Turing complete 
(otherwise, completely without any sort of proof, I suspect that it 
would be equivalent to a pushdown automata).

Looking at the program Tom linked, it seems to make pretty heavy use of 
these commands.  I can imagine it was a monstrous pain to write though. 
  Anything in particular that inspired you to give it a shot, or did it 
just seem like an interesting puzzle?

Warp wrote:
> Darren New <dne### [at] sanrrcom> wrote:
>> Out of curiousity, what kind of language or machine is this?
> 
>   Befunge.
> 
>   I tried to create a mandelbrot generator with it. Failed.
>

Post a reply to this message