From Esolang
Jump to navigation Jump to search

Metropolis-BF project

Alright, I'm fairly certain that it IS indeed Turing-complete. Its pretty much a regular old 2D Turing Machine. Just to be on the safe side, however, I'm working on syntax for a BF interpreter. I've also found a way around I/O I think, but that's a separate issue. Right now, the stuff I have implements BF instructions +, -, <, >, and [. I'm doing some weird stuff with matching [ and ], and trying to reuse states as much as possible to keep the complexity low. -Wildhalcyon 06:44, 16 Jun 2006 (UTC)