07/24/2014, 11:09 PM

Is it possible to easily rewrite rule 30 in terms of modular arithmetic ?

I Always want to rewrite cellular automatons/tag systems in terms of modular arithmetic. But it seems hard.

So take rule 30.

we have imput A , B , C and output D.

all values are either 0 or 1.

Can we easily find F(A,B,C) = D mod 2 or some similar modular arithmetic to do rule 30 ?

I assume to take F as an integer polynomial.

I consider replacing values 0,1 with 2,3 and doing F*(A,B,C) = D mod 5.

But Im still puzzled.

And kinda embarressed to ask.

There is, or might be , a slight connection to tetration. But dont ask yet, its complicated.

regards

tommy1729

I Always want to rewrite cellular automatons/tag systems in terms of modular arithmetic. But it seems hard.

So take rule 30.

we have imput A , B , C and output D.

all values are either 0 or 1.

Can we easily find F(A,B,C) = D mod 2 or some similar modular arithmetic to do rule 30 ?

I assume to take F as an integer polynomial.

I consider replacing values 0,1 with 2,3 and doing F*(A,B,C) = D mod 5.

But Im still puzzled.

And kinda embarressed to ask.

There is, or might be , a slight connection to tetration. But dont ask yet, its complicated.

regards

tommy1729