@isalpha "There is a sense in which FDAs [Finite Difference Approximations] themselves could be considered CA-like simulations." - From: "Cellular Automata: a Discrete Universe" (Ilachinski). The cells in the lattice wouldn't, however, be limited to a finite number of states (much like coupled-map lattices, in which the cells take on real values).
@isalpha dear retard. go fuck yourself. look up what cellular automata are, then fuck yourself. take whatever knowledge you think you have about finite techniques, and then go fuck yourself. you are clearly a huge tool. cellular automata are completely unrelated to finite difference techniques. go fuck yourself.
You need to understand gradient fields and the various operations that can be performed in 2D and 3D (curl \/x , divergence \/. and gradient \/) . These are calculated for each cell in a 2D or 3D grid, by analyzing the neighboring cells, then updating the grid accordingly. Some conditions like constant density or pressure may require solution-by-iteration for each time-step. Look up CFD on the GPU.
thanks for your comment. I wonder what is the difference between cellular automata and finite difference or FEM etc. methods. advantages or disadvantages. I can simulate wave prop. with fdtd, what is our benefits with c.a.
what is the appropriate applications for cellular automata
theoretically yes (in case the problem you want to simulate is turing-computable). A cellular automata has the same computational capacity a Turing machine has, which is, the same computational power as a computer bundled with infinite memory. But of course.. a computer's memory is not infinite!
Does CA use for solving diff. equ. like Laplace or Maxwell Equ?
daranbaba 1 year ago
@isalpha "There is a sense in which FDAs [Finite Difference Approximations] themselves could be considered CA-like simulations." - From: "Cellular Automata: a Discrete Universe" (Ilachinski). The cells in the lattice wouldn't, however, be limited to a finite number of states (much like coupled-map lattices, in which the cells take on real values).
42bazinga 1 year ago
You have to watch this site : realcomposer !
Thanks
centurycreole 1 year ago
@valdezmiguel2 i only ask a simple question. try to be a human little bit. i cant fuck myself dear. because i am fucking your mother now. idiot!!!
isalpha 1 year ago
@isalpha dear retard. go fuck yourself. look up what cellular automata are, then fuck yourself. take whatever knowledge you think you have about finite techniques, and then go fuck yourself. you are clearly a huge tool. cellular automata are completely unrelated to finite difference techniques. go fuck yourself.
valdezmiguel2 1 year ago
You need to understand gradient fields and the various operations that can be performed in 2D and 3D (curl \/x , divergence \/. and gradient \/) . These are calculated for each cell in a 2D or 3D grid, by analyzing the neighboring cells, then updating the grid accordingly. Some conditions like constant density or pressure may require solution-by-iteration for each time-step. Look up CFD on the GPU.
EdinburghGuy 1 year ago
Looks like the energy waves I see when I close my eyes.
fosheezeey2 2 years ago
thanks for your comment. I wonder what is the difference between cellular automata and finite difference or FEM etc. methods. advantages or disadvantages. I can simulate wave prop. with fdtd, what is our benefits with c.a.
what is the appropriate applications for cellular automata
isalpha 2 years ago
theoretically yes (in case the problem you want to simulate is turing-computable). A cellular automata has the same computational capacity a Turing machine has, which is, the same computational power as a computer bundled with infinite memory. But of course.. a computer's memory is not infinite!
MonoCabron123 2 years ago
We already are
cyborgtroy 2 years ago