You have explained in 8 minutes what my CS professor could not explain in an hour. May both sides of your pillow always be cold and you never step in a puddle with socks on❤️❤️❤️
When I was earning my master's degree, I heard a lot about finite state machines (FSMs), but it was all theory - like clouds in the sky: there's a lot of water, but you can't drink it. I toiled for three months after graduating until I implemented my first FSM in code in 1981. Now, there is a programming methodology based on this concept - v-agent oriented programming (VAOP) - with many examples of its implementation. It's best to start learning about VAOP with this article on Medium: "Bagels and Muffins of Programming or How Easy It Is to Convert a Bagel into a Black Hole".
Man, thanks for posting this. I've been the lead programmer for a couple of PC games now with smaller teams. The last one had a pretty heavy-handed project manager. In recent years, I've leaned heavily on your Muffin method ("I love that"), which seems to create a bell curve in productivity. Slow to start but fast on the tail and post-launch for bug handling. That is my flow, that is what makes my life easy ("well, easier"). Getting into larger teams, though, it seems inevitable that the investors want progress updates that are hard to hand off ("they don't understand the progress, the muffin") in the spring and impressive during winter. I would look forward to reading another Medium article concerning this if you were to write one. Thanks for writing down your knowledge.
Good video, I've just been learning from a book which makes it hard to visualize. I went from being extremely scared when looking at a state diagram, to finding them quite interesting.
I did miss the formal definition in this explanation: a Finite State Machine "M" is defined as quintuple, M = (Σ, S, s0, δ, F) where Σ is a finite non-empty set of symbols called the input alphabet, S is a finite and also non-empty set of states, s0 is an element of S and the initial state of the machine, δ is the state-transition function (δ : S x Σ → S in deterministic FSMs, δ : S x Σ → P(S) in non-deterministic ones) and F is a possibly empty subset of S containing the final states of the machine. A "computing machine that has a fixed set of possible states, a set of inputs that change the state, and a set of possible outputs" is a loose, incomplete and not very helpful definition.
You have explained in 8 minutes what my CS professor could not explain in an hour. May both sides of your pillow always be cold and you never step in a puddle with socks on❤️❤️❤️
this is the ultimate blessing 🤣
hahaha. Now that is a true blessing of luck!
(* here to double the comment for truth)
what a heartfelt message
When I was earning my master's degree, I heard a lot about finite state machines (FSMs), but it was all theory - like clouds in the sky: there's a lot of water, but you can't drink it. I toiled for three months after graduating until I implemented my first FSM in code in 1981. Now, there is a programming methodology based on this concept - v-agent oriented programming (VAOP) - with many examples of its implementation. It's best to start learning about VAOP with this article on Medium: "Bagels and Muffins of Programming or How Easy It Is to Convert a Bagel into a Black Hole".
Man, thanks for posting this. I've been the lead programmer for a couple of PC games now with smaller teams. The last one had a pretty heavy-handed project manager. In recent years, I've leaned heavily on your Muffin method ("I love that"), which seems to create a bell curve in productivity. Slow to start but fast on the tail and post-launch for bug handling. That is my flow, that is what makes my life easy ("well, easier"). Getting into larger teams, though, it seems inevitable that the investors want progress updates that are hard to hand off ("they don't understand the progress, the muffin") in the spring and impressive during winter. I would look forward to reading another Medium article concerning this if you were to write one. Thanks for writing down your knowledge.
Finally found an amazing ytube channel.... aaaaand it stopped uploading
I love this channel for the following reasons:
-Simple, illustrated explanations
-Easy to access
-Super useful
Loving your channel !
You are one of the few people that posts videos helping A- Level students with AQA computing
Keep doing what you're doing !
This was a fun explanation actually, really solid. Thank you.
This is so much better than an hour lecture. Modern education is so behind...
This video is a masterpiece. Thank you 🙏🏻
This is so good! Thank you very much!
Such an amazing video you make it so easy to understand Thank you!
:0
This was REALLY good!
I have an exam today and this genuinely saved my life thank you so much
This video is BASED. Thanks!
Thank you! Very much. It helps a lot.
tysm, this just made my life 1% easier :)
How does this no have more views it is phenomenal. Sooooo helpful.
PERFECT!!!!!! THANK YOU SO MUCH
great work!
Wow, great video keep them up would definitely recommend this channel it to my mates!
Fantastic video
Good video, I've just been learning from a book which makes it hard to visualize. I went from being extremely scared when looking at a state diagram, to finding them quite interesting.
thanks. This video was helpful
Loved your examples qnd methodology! Keep going
great vid!
Great explanation
wonderful video, very helpful
Thank you my lord
this video is so underrated!!!!
Thsnk you so much
Thank you sir!
simply super
Beautiful explanation in a more practical way
Looks a lot like a Markov chain.
Can I make 2 acceptable states for "a,b" machine to avoid an error with state 2? Or it doesn`t help?
Thank you so much Sir. This video was very helpful.
Thanks fam, good video
Good video. Now i totally understood
Good video and simple explanation.
GgGreat Video
Please upload more videos...Exam coming
I did miss the formal definition in this explanation: a Finite State Machine "M" is defined as quintuple, M = (Σ, S, s0, δ, F) where Σ is a finite non-empty set of symbols called the input alphabet, S is a finite and also non-empty set of states, s0 is an element of S and the initial state of the machine, δ is the state-transition function (δ : S x Σ → S in deterministic FSMs, δ : S x Σ → P(S) in non-deterministic ones) and F is a possibly empty subset of S containing the final states of the machine. A "computing machine that has a fixed set of possible states, a set of inputs that change the state, and a set of possible outputs" is a loose, incomplete and not very helpful definition.
missing traffic lights example
Saved my booty boy!
fine state machines solve a lot of problems.... but what kind of oil do they take? 0W20?
castrol
NEW FAN # 3.01K + 1
this is stamp for myself 6:12 i dont understand
Techno: *raining pigs*
Also Techno: "he doesn't know what's going on"
Meanwhile in the chat: "idiot"
Australian accent♥️♥️
Found the American ^^
1:25 loool