REDGREEN

From Esolang
Jump to: navigation, search
This article is a stub, which means that it is not detailed enough and needs to be expanded. Please help us by adding some more information.

REDGREEN is an update to RUBE, written in ALPACA. Unlike RUBE, it is a proper cellular automaton, not a bully automaton. As such, its description is much cleaner and its behavior is easier to predict, while it retains most of the "feel" of RUBE.

Computational class

REDGREEN contains John Conway's Game of Life cellular automaton as a subset within it, and Life has been shown to be Turing-complete; thus, REDGREEN should also be Turing-complete.

External resources