Are cellular automata useless?

Are cellular automata useless?

Other urls found in this thread:

bactra.org/reviews/wolfram/
reference.wolfram.com/language/tutorial/SomeNotesOnInternalImplementation.html
twitter.com/AnonBabble

Yes

more or less

They are too simple to be useful models, they are nice as examples that simple structures can be very hard to analyze and have surprising properties because you can visualize them (in contrast to e.g. lambda calculus)

I tried reading A New Kind of Science by Wolfram, he goes on and on about how his analysis of automata will have a profound impact in every field of study, but it comes across as 100% bunk.

>>it comes across as self-congratulatory advertisement

Yes

Or perhaps the application just hasn't been found yet

It's a type of Flatland, so no.

If you happen to want to simulate a Cone snail shell, then they're your man.

Other than that, well, would ant colony optimization count as a generalization of a cellular automaton? That seems useful.

really, how fucking retarded are you all?

you know all of wolfram alpha and mathematica is operating on and with CA.
It will soon be sophisticated enough to automate common math and statistics jobs done by humans atm.

and while you still deny the truth, I'll laugh at you pety idiots, still deriving shit manually.

>all of wolfram alpha and mathematica is operating on and with CA
Is this true?
Got any links to info on this? I'm genuinely very interested.

He does not because he is a pop-sci idiot.

lots of differential equations can be though off as automata, if you look at them in a finite difference way.
For example a diffusion process, discretised in space and time stemming from the PDE
[math]u_t + \Delta u = 0 [/math]
can be thought of cells checking out their neibours and filling up according to their neighbours values in the next timestep. This is

If you look at it from the numerical analysis side, you get a formulation like
[math] \frac{u_{i}^{n+1}-u_{i}^n}{\tau} + \frac{u_{i-1}^n-u_i^n+u_{i+1}^n}{h^2}=0 [/math]
by replacing differential operators with finite differences, which lets you solve for your solution vector at the n+1th timestep , when you know what it was a the nth.

I don't quite know about cone snail shells in particular, but a lot of pattern formation can be explained by looking for turing instability in reaction diffusion PDEs

>lots of differential equations can be though off as automata, if you look at them in a finite difference way.
So, as difference equations?

haven't heard that term yet, but from what I just read about it just now, yes.
are nonlinear implicit formulations like
[math] u_{n+1} = f(u_{n+1},u_{n}) [/math]
still in the realm of difference equations?

Yes, but it's a little fun you would've say.

I thought this was an interesting read. It was written by someone who got threatened with legal action by Wolfram after he cited the true discoverer of a result which was owned by Wolfram

bactra.org/reviews/wolfram/

not when you make them three dimensional and give it feelings

Go home Wolfram, you short unstable Jewish cock. You had five years of decent research and now you are just a miser that masturbates to his fading mind.

CA is used to solve and transform Diifferential Equations in Wolfram Language

just watch his TED talk he explains everything about it

CA literally is applied mathematics

I tried googling coautomata but I only found two references to archaic maths books written in the foreign language of academic mathematics

Reasonably, since the category of deterministic automata over a language [math] L [/math] is the category of coalgebras for the functor [math] 2\times (-)^{L}:Set\to Set [/math], we might define a deterministic coautomaton to be an object in its opposite category.

I was wondering since evaluating automata is comonadic/coeffectful (i.e. requiring context), if coautomata might be monadic or effectful

*
the context would be neighbouring cells, in cellular automata

I haven't studied this stuff in any real depth, so I can't offer much. But, I don't think the category of algebras for a monad is in general dual to the category of coalgebras for the comonad (assuming the adjoints are all endofunctors), so my definition would fail to satisfy what you are looking for I think.

\
>CA is used to solve and transform Diifferential Equations in Wolfram Language
No it's not. CA can be used to approximate some PDEs that have a spatial analogy. I doubt WolframAlpha even uses CAs to solve those.

But first you said "all of wolfram alpha and mathematica is operating on and with CA" now you are saying it's just differential equations (which is also a lie). So you obviously have no idea what you're talking about.

I never said "just" differential equations.

reference.wolfram.com/language/tutorial/SomeNotesOnInternalImplementation.html

>Any transformation rule—whether given as x−>y or in a definition—is automatically compiled into a form that allows for rapid pattern matching. Many different types of patterns are distinguished and are handled by special code.
>A form of hashing that takes account of blanks and other features of patterns is used in pattern matching.

>The internal code associated with pattern matching is approximately 250 pages long.

How is this not CA? prove me wrong or be stupid somewhere else.

What the fuck? That has nothing to do with cellular automata you delusional retard. It just describes a compiler.

and how does this compiler work you retard?

seriously READ THE NOTES BEFORE YOU WRITE!!!!

Some automata are turing-complete.

Type of Flatland? You know there's such thing as three-dimensional cellular automata, right?

>and how does this compiler work
Not through cellular automata.

>ctrl+f "cellular"
>2 results - one algorithm for pseudorandom numbers and one that calculates the evolution of cellular automata
and like you would expect, the differential equation solvers are just genereric multistep methods for ODEs and method of line approach (they don't make it clear, how they discretize spatially though) for PDEs, that have nothing much to do with CA

Strawberries and stop signs are both red.

I'm saying compiler =\> not turing complete

not automata*

you are only embarrising yourself now.