I am learning all by myself and I gotta say that this is the explanation I want to see. Well done explaining this! I also like the enthusiasm. It feels like you're a friend discussing. Keep up the good work! :D
appreciate you taking the time out of work to give out free education, helps those that wont end up going into collegiate level stuff, but still want to learn i also noticed you laughing at the quality, but i subbed just for this, it was super helpful!
18:30 The problem here is that this is not "complete randomness". Behaviour of automata is strictly determined, non-chaotic, and depends just on starting values. It doesn't even depend on random number generator, because.....there is ..... simply.....not present any random number generator in the code - just a set of rules. If you repeat your experiment milion times, up to a infinite number of iterations you'll get exactly the same results, depending just on 1. Set of rules, and 2. Starting values.
Great vid, love the meta stuff, just crushing that 4th wall. I did get some comprehension of ca I didn’t have before, thanx. You probably know this by now, but wolfram alpha does use rule 30 as a pseudo random generator. Good intuition! Hitting subscribe now.
You've inspired me. @12.17, you talk about a 2d grid that becomes a frame in a sequence of frames in an animation. How about -- rather than a 1d automata that becomes a 2d grid, how about a 1d grid of cells that's animated. OR how about a sequence of 2d grids, stacked one on top of the other to form a 3d shape. Then add a left-eye / right-eye projection and view it cross-eyed (or the other way). And then rotate it about any axis in the same way chemists might rotate a molecule in space. I wonder if that will yield new insights into the rule sets.
.. or weight with sequences of primes, or add in rules the choice of which is determined by the previous line.. did you get anywhere with your suggestion? UK amateur here :)
I have a question which is about on video 6.22, he say 000 represent 0, 001 represent 0, 010 represent 1 and .... so on. Why 000 is represent to 0 , can it become 1? or it just user to random define which mean that we can defined 000 as zero or one both is accepted?
and now to the question, that everybody here craves to ask but is afraid that it will open a pandora's box.. how to we handle the left most and the right most cells, hah? ;p examining your generate function i noticed, that you simply let them remain unchanged, treating them as what i believe are called a shadow cells: the cells that serve as a source of information for their neighbors, but do not constitute as an actual cells themselves. and this is great, don't get me wrong. but i just wonder whether new interesting, never-seen-before patterns couldn't have emerged if we've linked the right most cell with the left most one instead (i.e. by treating our grid like a circle and not like a segment).
actually the left and rightmost cells are being used the generational algorithm displays top down and you can see the wave outward from the middle cell because in this particular cellular automaton they always start with 1 singular cell in the middle preactivated. The outcome depends on the particular rule as well as the starting world (Which the latter was controlled for this demonstration; always 1 cell preactivated in the same location in GEN1).
Thank you for the Link :-) ! I also read this chapter natureofcode.com/book/chapter-7-cellular-automata/ of your book, because i did not understood the concept of the automatons fully. But after your video and the chapter of your book, things are now much more clearer :-) .
K: "And blood-black nothingness began to spin... A system of cells interlinked within cells interlinked within cells interlinked within one stem... And dreadfully distinct against the dark, a tall white fountain played." Interrogator: Cells. K: Cells. Interrogator: Have you ever been in an institution? Cells. K: Cells. Interrogator: Do they keep you in a cell? Cells. K: Cells. Interrogator: When you're not performing your duties do they keep you in a little box? Cells. K: Cells. Interrogator: Interlinked. K: Interlinked. Interrogator: What's it like to hold the hand of someone you love? Interlinked. K: Interlinked. Interrogator: Did they teach you how to feel finger to finger? Interlinked. K: Interlinked. Interrogator: Do you long for having your heart interlinked? Interlinked. K: Interlinked. Interrogator: Do you dream about being interlinked... ? K: Interlinked. Interrogator: What's it like to hold your child in your arms? Interlinked. K: Interlinked. Interrogator: Do you feel that there's a part of you that's missing? Interlinked. K: Interlinked. Interrogator: Within cells interlinked. K: Within cells interlinked. Interrogator: Why don't you say that three times: Within cells interlinked. K: Within cells interlinked. Within cells interlinked. Within cells interlinked. Interrogator: We're done. "Constant K"... you can pick up your bonus. K: Thank you, sir.
full project: 1drv.ms/f/s!AlCwAhlxoW_Qg8UdNR5jmg-o-DaXTw These are the functions that play with the resolution each frame void InitCells(int res_){ res = res_; xLen = width/res; yLen = height/res; cells = new int[xLen][yLen]; cells[xLen/2][0] = 1; } This is my render function, essentially mapping the pixels to elements of the 2D cell array. this seems to be a very fast way of drawing lots of little squares void Render() { loadPixels(); for (int y = 0; y < height; y++) { for (int x = 0; x < width; x++) { int iX = constrain( x/res, 0, xLen-1); //heres where it maps int iY = constrain( y/res, 0, yLen-1); //and here :-) if (cells[iX][iY] == 0) { pixels[x + y * width] = color(255, 0, 255); } else { pixels[x + y * width] = color(0, 255, 0); } } } updatePixels(); }
Nature is not following any Celular automata rule.. Is totally the opposite, CA is modeling nature. We model nature in a very clever way by usig celular automata interaction rules... We are triying to model nature and it is not perfect at all... The model wich is discrete is trying to model nature.. the real thing (nature) is not discrete, is the model... do you see the diferene betwen the model and the real thing??
There's a theory in modern quantum mechanics that the most fundamental "stuff" of the universe is actually pure information which comes in descrete packages that are either in an on or off state, 1 or 0. Each 3D pixel (voxel) of the universe is either a 0 or a 1 and all the universe's phenomena are higher-level manifestations of those voxels interacting with each other according to a certain ruleset.
shorter way to implement rules function would be: int rules( int left, int me, int right ) { int idx = 4*left + 2*me + right; return ruleset[ 7 - idx ]; }
First let me say that I love your videos! It took me a while to figure out the logic of Wolframs rulesets, but once it clicked now I'm hooked. I am curious though. At 5:52 You made up a rule of (00101110) which is Wolframs ruleset #46. Ok, all is well in my mind, since 46 is the decimal equivalent of binary 00101110. But when I look at your code at 10:27 I got confused. This is because when I compare the decimal rule numbers in your code comments they don't correspond to Wolfram's rulesets. For example, 01111011 should be 123 not 222, since 222 has a binary equivalent of 11011110 . Can you explain this? Am I missing something? ------------------- (edit) Never mind, I see now that they are backwards in your array. Example: the conjugate of ruleset = {0, 1, 1, 1, 1, 0, 1, 1} is 11011110. ------------------- Thank You!
I enjoyed this "stream of consciousness" style presentation and the "let`s have some fun with this great hobby" attitude. A nice refreshment after all the pompous, overstressed, getting a job oriented, "I`m better than others" programming videos that youtube is so full off. Your video took me back from the horrible "i have to program more or else" attitude that I got into, to "i want to program now!" joyful state. So... THANK YOU!
Wanted to give some appreciation for the efforts you took to make these videos. We can tell you, like the average engineer, is probably a little awkward. Yet you're obviously doing your best to lighten things up. Thanks you.
If stacked 1D CA generate emergent 2D patterns. Does a 2D CA generate 3D patterns when stacked in a lattice? Reminiscent of holographic principle? "The holographic principle is a tenet of string theories and a supposed property of quantum gravity that states that the description of a volume of space can be thought of as encoded on a lower-dimensional boundary to the region" Space and the dynamic things in it being an emergent 3D pattern. Which means we are already ghosts of some curious nature.
I noticed that when you make your temporary array to calculate the next generation you're making a for loop to copy all the elements over. This works fine but Processing3 has a built-in function that does this for you. It's called arrayCopy. So you may replace your for loop with arrayCopy(gen, nextGen); or whatever you want to call your arrays. (The first parameter is copied into the second).
At 4:18, in a sense you were correct to say that you don't evolve generation 1, but rather compute it. However, there is a hidden accumulation of change (or potential change) over multiple cells in the production of generation 1, and any accumulation of change is evolution. Generation 2 is of course unmistakably evolved from generation 0 by way of generation 1.
It would be interesting to see what happens if you could change the rule set between generations. An oscillation between rule 30 and 110, something to that effect. I would imagine that the capacity for complexity would explode exponentially, especially if you determined the rule set by sampling eight consecutive cells from rule 30, each generation changing the rule set. This wouldn't be difficult to do with Python, thanks for the stimulating video!
Hi! I know this video is quite old but I was trying to create a wolfram elementary simulator in python, but I ran into a problem, which is handling edges. What am I supposed to do with the edges of the grid, since I can't make the grid infinite? If I simply try to request the next cell of the last, I get an index error.
Extremely helpful for both my project and my understanding of this topic... This series of videos is truly amazing and you make it very interesting too. Whats more, in the last video you proposed some ways to apply c. a. and expand our knowledge on them. I appreciate your work very much.
i actually did a random start of cells, when u said try make one your self last video and each cell calculates its value by saying if(neigbor[x] == 1) state = !state; that the result sure that gonna be some rule like 01101001 that kinda xor or rule 113
I only wonder how you get the left index of cell[0](or the right for cell[cells.length-1]) without a boundary constraint(and more important not causing an index out of range on the array itself)? Does it wrap around? Is it always 0, or 1? Don't see it in the code. Boring question but still..
At 13:00 it looks like you did your binary math a little off. The right most bit represents 1, not 2. You were just shifted by one place that’s all. So 0101 would be 5, not 10 for example.
I'm at least close to the truth when I believe that from a few simple rules (charge, spin, and attraction, aka the electromagnetic force, the 2 nuclear forces, and the gravitational force) complexity arises. Witness: the world in which we live. :)
Got here because I picked up A New Kind of Science on a whim with very little prior knowledge, and I needed help visualizing how c.a. work. It makes me really happy to be able to learn from someone who clearly thinks the material is as exciting and fascinating as I do. It's nice to know I'm not the only one who gets passionate about how cool this stuff is, lol :) Thanks for the help!
There is a lot of assumption that some of the results are completely random non-repeating, but I don't see any lines of code checking to see if any lines repeat.
5:22 :'-D Excellent explanation though. I'm already familiar with CA's, and am learning python 3.0 to attempt philosophical in-silica experiments, just stumbled upon your video and am enjoying the side-info a lot. And your enthusiasm is contagious. EDIT: 8:03, I'm slapping my knees.
What if I map my 1-dimensional CA onto the surface of a circle, and then I make every cell the same state: do they all cease to exist? What if my CA demands an intermediary state and-or translation? Would it be forced oscilate? What are some solutions to an edge case like this?
What if, instead of tracking each cell, we just scanned the entire image, gave each state a unique color, and then did a single gpu calculation on the entire frame, regardless of how many things are going on at once? [Because it would require the same number of computational steps, on every iteration of ths engine's loop]
yoo 2^2^x where x is the number of neighbors is the number of rules an automata has... that's amazing! If we do a 2D CA, we know for sure that for 8 neighbors, we got 2^2^9 possibilities, wich is something to the 154 or something! That's like terribly huge! Have we tried every single automata in 2D yet? and what about 26 neighbors (in 3D)?? I think I'm gonna pass the rest of my life playing with automatas.....
Pretty interesting. Only it seems to be overly complicated. It's easier to understand but not at all resource friendly. Note: I''m used to write for micro controllers with 2k ROM and 256B of RAM. My approach: I would replace the array for a single n bit value. 1. Mask the bits i need to compute the next generation. 2. Lookup the next value of the cell. 3. Repeat 1,2 for the binary length There are some tricks like making a struct or array of binairy numbers. (saved as one int)
nextgen[i] will skip 0 and cells.length because u start from 1 and end at cells.length - 1 which is logical but that will lead to undefined behavior cause nextgen[0] and nextgen[cell.length - 1] is uninitialized
You completely forgot to mention why this is useful or interesting, other than just enticing to look at. other than this, this video is prime example where you feel like you should verify the information you find online as you don't even seem certain of the things you say... good explanation otherwise
Great video! Very easy to follow and entertaining. There is a thing I don't understand. If gen0 is an array filled with 0, for any ruleset where 0,0,0 = 0, how does anything at all happen?
8:00 What about border values? Do we "wrap" all the array, so -1 index becomes n, and (n+1) becomes zero index? Or we make special rules just for one neighbour at the border?
for people using processing, if you try to input ruleset in right way (github files need you to implement ruleset in reversed way) just make change in CA file this way. CA(int[] r) { ruleset = reverse(r); cols = width/w; rows = height/w; matrix = new int[cols][rows]; restart(); }
16:45 For those asking for a way to quickly index, you may do a*2^2+b*2^1*c*2^0 = 4*a+2*b+c for this example (neighborhood=3 squares, base=2). This results in ::: return ruleset[4*a+2*b+c];
Hey man these videos are awesome. This one's really old so I don't know how you do them now, but they're way better than you say! Though even then, you say it in a relaxed, more human way so not annoying self deprecation. That aside, I'm gonna take a guess and say that the fractal rule counts as complexity since in a way applying the same rule in each iteration is repetition, regardless of what rule it is. I hope it's not silly-level wrong, I'll find out!
I am learning all by myself and I gotta say that this is the explanation I want to see. Well done explaining this! I also like the enthusiasm. It feels like you're a friend discussing. Keep up the good work! :D
I'm so glad to hear, thank you!
No problem. Would you create more of these vids? I'm interested in 2D CA and I hope you'll create more videos about that.
Totally agree - the enthusiasm is infectious (in a very good non pandemic way) - this is great!!
"this is not my best video"
me : this is one of the best videos I've ever seen on youtube ^_^ .
keep going bro , you are amazing .
lol simp
hahah true, best train ride I've ever had with this video
14:27 "This is not my best video, but I'm gonna keep going" 😂😂😂😂😂😂😂
appreciate you taking the time out of work to give out free education, helps those that wont end up going into collegiate level stuff, but still want to learn
i also noticed you laughing at the quality, but i subbed just for this, it was super helpful!
18:30 The problem here is that this is not "complete randomness". Behaviour of automata is strictly determined, non-chaotic, and depends just on starting values. It doesn't even depend on random number generator, because.....there is ..... simply.....not present any random number generator in the code - just a set of rules. If you repeat your experiment milion times, up to a infinite number of iterations you'll get exactly the same results, depending just on 1. Set of rules, and 2. Starting values.
This has probably been commented upon already, but: niiiiiice choice of shirt for this video. Full marks.
Great vid, love the meta stuff, just crushing that 4th wall.
I did get some comprehension of ca I didn’t have before, thanx.
You probably know this by now, but wolfram alpha does use rule 30 as a pseudo random generator. Good intuition!
Hitting subscribe now.
14:04 "or previous videos" and the swag is amazing - thanks for the video!
You've inspired me. @12.17, you talk about a 2d grid that becomes a frame in a sequence of frames in an animation. How about -- rather than a 1d automata that becomes a 2d grid, how about a 1d grid of cells that's animated. OR how about a sequence of 2d grids, stacked one on top of the other to form a 3d shape. Then add a left-eye / right-eye projection and view it cross-eyed (or the other way). And then rotate it about any axis in the same way chemists might rotate a molecule in space. I wonder if that will yield new insights into the rule sets.
I've thought the same thing, I'd love to see how it would look in 3d
This man is perfect
What if we make a loop of rules...
Line 1 -> rule 4,
line 2 -> rule 222,
L3 -> r134, and loop again.
With 2 rules looping you'll have 64k behaviours
.. or weight with sequences of primes, or add in rules the choice of which is determined by the previous line.. did you get anywhere with your suggestion? UK amateur here :)
How to calculate the cells on the edge? They have only two cells above them.
The best example ever of "being all over the place". Lol. Great lecture btw.
:) informative and fun! Best way to learn Thnx!
So glad to hear, thank you!
Great video! Really enjoyed your way of explaining the topic. Keep it up I just subed!
yay, thank you!
I have a question which is about on video 6.22, he say 000 represent 0, 001 represent 0, 010 represent 1 and .... so on. Why 000 is represent to 0 , can it become 1? or it just user to random define which mean that we can defined 000 as zero or one both is accepted?
This guy loves his automata
Very helpful, and fun tut! Thanks :)
repetition is naturally occuring when it comes to true randomness
Wtf "true randomness" doesnt exist, just because we cant predict when/where/how its going to happen
and now to the question, that everybody here craves to ask but is afraid that it will open a pandora's box..
how to we handle the left most and the right most cells, hah? ;p
examining your generate function i noticed, that you simply let them remain unchanged, treating them as what i believe are called a shadow cells: the cells that serve as a source of information for their neighbors, but do not constitute as an actual cells themselves.
and this is great, don't get me wrong. but i just wonder whether new interesting, never-seen-before patterns couldn't have emerged if we've linked the right most cell with the left most one instead (i.e. by treating our grid like a circle and not like a segment).
you just give them a default value. wether 0 or 1
actually the left and rightmost cells are being used the generational algorithm displays top down and you can see the wave outward from the middle cell because in this particular cellular automaton they always start with 1 singular cell in the middle preactivated. The outcome depends on the particular rule as well as the starting world (Which the latter was controlled for this demonstration; always 1 cell preactivated in the same location in GEN1).
the tape is infinite in both directions i believe
Like space invaders?.. you could certainly join the left and right edges to form a tube, then the tube rims to form a doughnut..
Are Wolfram's Rulsesets also working for 1D Cell automatons with 1 or 2 Cells?
I'm not sure exactly what you mean, but you can see all the rulesets for 1D CAs here: mathworld.wolfram.com/ElementaryCellularAutomaton.html
Thank you for the Link :-) ! I also read this chapter natureofcode.com/book/chapter-7-cellular-automata/ of your book, because i did not understood the concept of the automatons fully. But after your video and the chapter of your book, things are now much more clearer :-) .
thank you
You are showing the work of Claude Shannon.
This is great, thank you
K: "And blood-black nothingness began to spin... A system of cells interlinked within cells interlinked within cells interlinked within one stem... And dreadfully distinct against the dark, a tall white fountain played."
Interrogator: Cells.
K: Cells.
Interrogator: Have you ever been in an institution? Cells.
K: Cells.
Interrogator: Do they keep you in a cell? Cells.
K: Cells.
Interrogator: When you're not performing your duties do they keep you in a little box? Cells.
K: Cells.
Interrogator: Interlinked.
K: Interlinked.
Interrogator: What's it like to hold the hand of someone you love? Interlinked.
K: Interlinked.
Interrogator: Did they teach you how to feel finger to finger? Interlinked.
K: Interlinked.
Interrogator: Do you long for having your heart interlinked? Interlinked.
K: Interlinked.
Interrogator: Do you dream about being interlinked... ?
K: Interlinked.
Interrogator: What's it like to hold your child in your arms? Interlinked.
K: Interlinked.
Interrogator: Do you feel that there's a part of you that's missing? Interlinked.
K: Interlinked.
Interrogator: Within cells interlinked.
K: Within cells interlinked.
Interrogator: Why don't you say that three times: Within cells interlinked.
K: Within cells interlinked. Within cells interlinked. Within cells interlinked.
Interrogator: We're done. "Constant K"... you can pick up your bonus.
K: Thank you, sir.
omg decrese cell size over time = suuuuuper cool!!!! :-D
nice tip!
I've been trying to do that unsuccessfully, how did you manage to do it ?
full project: 1drv.ms/f/s!AlCwAhlxoW_Qg8UdNR5jmg-o-DaXTw
These are the functions that play with the resolution each frame
void InitCells(int res_){
res = res_;
xLen = width/res;
yLen = height/res;
cells = new int[xLen][yLen];
cells[xLen/2][0] = 1;
}
This is my render function, essentially mapping the pixels to elements of the 2D cell array. this seems to be a very fast way of drawing lots of little squares
void Render() {
loadPixels();
for (int y = 0; y < height; y++) {
for (int x = 0; x < width; x++) {
int iX = constrain( x/res, 0, xLen-1); //heres where it maps
int iY = constrain( y/res, 0, yLen-1); //and here :-)
if (cells[iX][iY] == 0) {
pixels[x + y * width] = color(255, 0, 255);
} else {
pixels[x + y * width] = color(0, 255, 0);
}
}
}
updatePixels();
}
17:31, could use KMAPS
This is making my head hurt. I need apply this to a Real Time Strategy game or something like for motivation.
I thought I was dropping frames lol :D apparently I've dropped 0 out of 1000 at the beggining :P
I think complexity is irrelevant because it involves chaos and absence of pattern
But then, what is your gen 0
Weird video, it keeps jerking around like a bad connection but I checked and other videos are fine.
nice shirt!
kkkkk, man you are very crazy. Thank you!
Tip: not necessary to imitate someone who is overdosing on speed and sugar at the same time.
I got here looking up pancomputationalism.
You have randomly created this in binary: .
Nature is not following any Celular automata rule.. Is totally the opposite, CA is modeling nature. We model nature in a very clever way by usig celular automata interaction rules... We are triying to model nature and it is not perfect at all... The model wich is discrete is trying to model nature.. the real thing (nature) is not discrete, is the model... do you see the diferene betwen the model and the real thing??
Read Douglas R. Hofstadter: "Gödel, Escher, Bach". He has some great insights on this
4 lines to say absolutely nothing.
There's a theory in modern quantum mechanics that the most fundamental "stuff" of the universe is actually pure information which comes in descrete packages that are either in an on or off state, 1 or 0. Each 3D pixel (voxel) of the universe is either a 0 or a 1 and all the universe's phenomena are higher-level manifestations of those voxels interacting with each other according to a certain ruleset.
01110011 Alt J
Are You a scientist or a comedian…??? 🤔
cocaine is hell of a drug.
But very good video!
+mushman05 hah. Thanks for the feedback.
@@TheCodingTrain I don't agree with that feedback. Good video all around!
You are a sad individual!
you could get double experience if you watch it in 2x
MATH. Not even once.
the framerate in the clip makes me dizzy.
It's better if you play at 0.75x
😻😻
shorter way to implement rules function would be:
int rules( int left, int me, int right ) {
int idx = 4*left + 2*me + right;
return ruleset[ 7 - idx ];
}
Yes!!!! 7 - idx This is the fix I needed for my code to agree with Wolfram's output. Thanks.
@@egregory314 Ah, you had your table upside-down!
You could use (left
@@greenaum For multiplication or division by powers of 2, a good compiler will optimize that to bit shifts anyway.
First let me say that I love your videos!
It took me a while to figure out the logic of Wolframs rulesets, but once it clicked now I'm hooked.
I am curious though. At 5:52 You made up a rule of (00101110) which is Wolframs ruleset #46. Ok, all is well in my mind, since 46 is the decimal equivalent of binary 00101110. But when I look at your code at 10:27 I got confused. This is because when I compare the decimal rule numbers in your code comments they don't correspond to Wolfram's rulesets. For example, 01111011 should be 123 not 222, since 222 has a binary equivalent of 11011110 . Can you explain this? Am I missing something?
-------------------
(edit) Never mind, I see now that they are backwards in your array. Example: the conjugate of ruleset = {0, 1, 1, 1, 1, 0, 1, 1} is 11011110.
-------------------
Thank You!
And how rules work in the margins of the array where reference can be made only for 1 or 2 cells of the previous generation?
I enjoyed this "stream of consciousness" style presentation and the "let`s have some fun with this great hobby" attitude. A nice refreshment after all the pompous, overstressed, getting a job oriented, "I`m better than others" programming videos that youtube is so full off. Your video took me back from the horrible "i have to program more or else" attitude that I got into, to "i want to program now!" joyful state.
So... THANK YOU!
Wanted to give some appreciation for the efforts you took to make these videos. We can tell you, like the average engineer, is probably a little awkward. Yet you're obviously doing your best to lighten things up. Thanks you.
Great explanation of CA, thanks man. And yeah, really like your teaching style :)
If stacked 1D CA generate emergent 2D patterns. Does a 2D CA generate 3D patterns when stacked in a lattice? Reminiscent of holographic principle?
"The holographic principle is a tenet of string theories and a supposed property of quantum gravity that states that the description of a volume of space can be thought of as encoded on a lower-dimensional boundary to the region"
Space and the dynamic things in it being an emergent 3D pattern. Which means we are already ghosts of some curious nature.
i argue fractal is not complexity if obvious to the eye its a "slowest path of simple to complexity lol" if it is infinite complexity
I wonder how this dude would look like on high caffeine amounts and a nice dosis of not sleeping huehuehue
I got a seashell with a rule 135 ish pattern on..... These exist in nature...
Hi. UK here. Good spot - me too. Follow your observation up.. :)
That "if you're not too busy" comment around 7:30 really got me.
Warning: in 2 years time you are going to fall of your bike.
Your comment haunts me to this day. I'm still waiting.
jokes on you. I never ride a bike
success you were correct
Ok what how did you know
i like how rule 34 is just a stick
Hocam bizi nerelere attınız ya. Adam kokain çekip gelmiş herhalde. CS223 projesini bitirmenin sırrı bu mu yoksa?
I noticed that when you make your temporary array to calculate the next generation you're making a for loop to copy all the elements over. This works fine but Processing3 has a built-in function that does this for you. It's called arrayCopy. So you may replace your for loop with arrayCopy(gen, nextGen); or whatever you want to call your arrays. (The first parameter is copied into the second).
At 4:18, in a sense you were correct to say that you don't evolve generation 1, but rather compute it. However, there is a hidden accumulation of change (or potential change) over multiple cells in the production of generation 1, and any accumulation of change is evolution. Generation 2 is of course unmistakably evolved from generation 0 by way of generation 1.
It would be interesting to see what happens if you could change the rule set between generations. An oscillation between rule 30 and 110, something to that effect. I would imagine that the capacity for complexity would explode exponentially, especially if you determined the rule set by sampling eight consecutive cells from rule 30, each generation changing the rule set. This wouldn't be difficult to do with Python, thanks for the stimulating video!
Oh man I should have studied pure mathematics.
I like how he just redid this video this year
Hi! I know this video is quite old but I was trying to create a wolfram elementary simulator in python, but I ran into a problem, which is handling edges.
What am I supposed to do with the edges of the grid, since I can't make the grid infinite? If I simply try to request the next cell of the last, I get an index error.
There are two ways edges are usually handled. You either set a fixed boundary condition or you wrap the boundaries like a pac-man game.
Extremely helpful for both my project and my understanding of this topic... This series of videos is truly amazing and you make it very interesting too. Whats more, in the last video you proposed some ways to apply c. a. and expand our knowledge on them. I appreciate your work very much.
i actually did a random start of cells,
when u said try make one your self last video
and each cell calculates its value by saying
if(neigbor[x] == 1)
state = !state;
that the result
sure that gonna be some rule
like
01101001
that kinda xor
or rule 113
I only wonder how you get the left index of cell[0](or the right for cell[cells.length-1]) without a boundary constraint(and more important not causing an index out of range on the array itself)? Does it wrap around? Is it always 0, or 1? Don't see it in the code. Boring question but still..
At 13:00 it looks like you did your binary math a little off. The right most bit represents 1, not 2. You were just shifted by one place that’s all. So 0101 would be 5, not 10 for example.
I'm at least close to the truth when I believe that from a few simple rules (charge, spin, and attraction, aka the electromagnetic force, the 2 nuclear forces, and the gravitational force) complexity arises. Witness: the world in which we live. :)
Advent of Code 2018 Day 12 uses similar ideas. It uses a 5 cell neighborhood.
Got here because I picked up A New Kind of Science on a whim with very little prior knowledge, and I needed help visualizing how c.a. work. It makes me really happy to be able to learn from someone who clearly thinks the material is as exciting and fascinating as I do. It's nice to know I'm not the only one who gets passionate about how cool this stuff is, lol :) Thanks for the help!
There is a lot of assumption that some of the results are completely random non-repeating, but I don't see any lines of code checking to see if any lines repeat.
Can’t tell if he’s excited or recasted
Was going to say devastated but I think recasted is randomly interesting
5:22 :'-D
Excellent explanation though. I'm already familiar with CA's, and am learning python 3.0 to attempt philosophical in-silica experiments, just stumbled upon your video and am enjoying the side-info a lot. And your enthusiasm is contagious.
EDIT: 8:03, I'm slapping my knees.
Wonderful way of teaching. Plz provide a lecture how to implement irregular cellular automata
What if I map my 1-dimensional CA onto the surface of a circle, and then I make every cell the same state: do they all cease to exist? What if my CA demands an intermediary state and-or translation?
Would it be forced oscilate?
What are some solutions to an edge case like this?
What if, instead of tracking each cell, we just scanned the entire image, gave each state a unique color, and then did a single gpu calculation on the entire frame, regardless of how many things are going on at once? [Because it would require the same number of computational steps, on every iteration of ths engine's loop]
@@niaschim sounds like a pixelation of sorts? UK amateur here.
12:50 I think it is "Repetition"
This was my introduction to CA and I found it very helpful for my understanding and very amazing results! Thanks!
You are hilarious. I wish I had once a teacher half -- no, a quarter as fun as you are.
Just love all this energy and passion! Makes the content a lot more engaging! Kudos!
I have more clue of how good he is coding everything than fps the video has
@17:43 Isn't repetition a necessary part of complexity?
Thanks for your wonderful lecture...
love it - interesting and made me laugh out loud! thanks
Greetings sir i think i need money.
yoo 2^2^x where x is the number of neighbors is the number of rules an automata has... that's amazing!
If we do a 2D CA, we know for sure that for 8 neighbors, we got 2^2^9 possibilities, wich is something to the 154 or something! That's like terribly huge! Have we tried every single automata in 2D yet?
and what about 26 neighbors (in 3D)?? I think I'm gonna pass the rest of my life playing with automatas.....
Very nice! I followed your example and did this today as well on my channel using MATLAB. Cellular Automata!!
Dude ... lay off the coffee.
Pretty interesting. Only it seems to be overly complicated. It's easier to understand but not at all resource friendly.
Note: I''m used to write for micro controllers with 2k ROM and 256B of RAM.
My approach:
I would replace the array for a single n bit value.
1. Mask the bits i need to compute the next generation.
2. Lookup the next value of the cell.
3. Repeat 1,2 for the binary length
There are some tricks like making a struct or array of binairy numbers. (saved as one int)
nextgen[i] will skip 0 and cells.length because u start from 1 and end at cells.length - 1 which is logical but that will lead to undefined behavior cause nextgen[0] and nextgen[cell.length - 1] is uninitialized
You completely forgot to mention why this is useful or interesting, other than just enticing to look at. other than this, this video is prime example where you feel like you should verify the information you find online as you don't even seem certain of the things you say... good explanation otherwise
let's take a look at rule34 :D
14:30 "this is not my best video". maybe not, but the content is totally solid. take a breath man, slow by 10%, it's good stuff
who is that young man in this video??!!
Great video! Very easy to follow and entertaining. There is a thing I don't understand. If gen0 is an array filled with 0, for any ruleset where 0,0,0 = 0, how does anything at all happen?
I just found your channel and boooy i am addicted to it!
8:00 What about border values? Do we "wrap" all the array, so -1 index becomes n, and (n+1) becomes zero index? Or we make special rules just for one neighbour at the border?
The only coding channel that I enjoy!
for people using processing, if you try to input ruleset in right way (github files need you to implement ruleset in reversed way) just make change in
CA file this way.
CA(int[] r) {
ruleset = reverse(r);
cols = width/w;
rows = height/w;
matrix = new int[cols][rows];
restart();
}
6:37 rule 46
16:45 For those asking for a way to quickly index, you may do a*2^2+b*2^1*c*2^0 = 4*a+2*b+c for this example (neighborhood=3 squares, base=2). This results in ::: return ruleset[4*a+2*b+c];
Hey man these videos are awesome. This one's really old so I don't know how you do them now, but they're way better than you say! Though even then, you say it in a relaxed, more human way so not annoying self deprecation.
That aside, I'm gonna take a guess and say that the fractal rule counts as complexity since in a way applying the same rule in each iteration is repetition, regardless of what rule it is. I hope it's not silly-level wrong, I'll find out!