Crystal-complete

From Esolang
Jump to navigation Jump to search

A programming language is considered crystal-complete if it meets all the following criteria:

  • It is able to print “TRANS RIGHTS”.
  • It is able to print the following (newlines included):
x = 23, y = 11, rule = B3/S23
11bo$4bo3bo5bo3bo$3bobo11bobo$3bobo11bobo$2obobob9obobob2o$2obo15bob2o
$3bo15bo$3bobo4bobo4bobo$4b2o4b2obo3b2o$13bo$13b2o!
  • It can do a non-empty quine.
  • It can store the number 1103 in its memory.
Retrieved from "https://esolangs.org/w/index.php?title=Crystal-complete&oldid=153202"