ConwayLife.com

Just finished up a little Python script that will make generating these patterns much easier for anyone who cares to :lol:

Now there's just two steps in the process, and it's orders of magnitude faster than before:

1) Generate your CTS initial condition for Rule 110 in Mathematica using the ...

One more for the road -- this CTS is defined by the rule [{{1, 1, 0, 1, 0, 1}, {1, 1, 0, 0, 0, 0}}, {0, 1}] and is again an example taken from Wolfram's book. The resulting pattern contains 219,205 unit cells.

Thanks folks! :) Apologies for my cluelessness about RLE files. In the end I combined inspiration from both of your scripts. I found that both the g.getstring() and g.getclipstr() top out at about 125,000 characters, so I had to get something working on the command line. Then I found that I needed ...

If I've generated long binary strings that equate to initial conditions for Wolfram Rule 110, is there a script out there that can convert this to an RLE or MC? Basically just translating a long binary string into a long line of on/off cells.

test it pls, might be buggy - in perl. I can rewrite ...

If I've generated long binary strings that equate to initial conditions for Wolfram Rule 110, is there a script out there that can convert this to an RLE or MC? Basically just translating a long binary string into a long line of on/off cells.

Another experiment with a Rule 110 cyclic tag system implemented with unit cells.

This time, I generated an initial condition using Mathematica for a cyclic tag system defined by the rule set [{{0, 0, 0, 0, 0, 0}, {}, {1, 1, 1, 1, 1, 1}, {}}, {1}]. The script for accomplishing this can be found in ...

So I've been developing some interesting patterns to show off as part of some lectures about computational universality, and ended up putting together a pattern that's kind of interesting to observe.

I went back to Matthew Cook's 2004 paper proving the universality of Wolfram Rule 110, then looked ...

I was looking for C to Turing compiler, but it seems like this is more theoretical machine rather than actual programming tool.


There is a programming language called Laconic, a high-level language which compiles into 4- or 2-state Turing machines, if that helps: https://www.scottaaronson.com ...

KittyTac wrote:Imagine if Langton's ant would be proven universal.

Langton's Ant was proven universal back in 2000: http://www.dim.uchile.cl/~anmoreir/ofic ... on_dam.pdf

Just taken a quick look at this, interesting Looking forward to hearing more about the machine language!

So far I believe there have been only two or three pieces of code written to do this kind of thing. The first is a Perl script written by Brice Due a long time ago (2006):

This is brilliant, thank you! :) Just to road-test the Perl script, I used it to metafy a 16x16 Deep Cell test pattern. It ...

Maybe I'm missing something, but don't those scripts only tile the OTCA metapixels, not Deep Cells or any of the other unit cell types? I'm wondering if there are scripts doing the same thing but for other unit cells (edit: just Deep Cells now).

Also those scripts run within Golly, and several ...

I was playing with the meta-meta-blinker pattern using OTCA metapixels earlier, but obviously trying to generate meta-patterns that large within Golly causes RAM issues pretty quickly. Are there any scripts out there for generating huge meta-patterns outside Golly?

While we're at it, are there ...