- Видео 10
- Просмотров 6 251
MarshySyntax
Добавлен 4 июл 2024
Exploring Pi through Code
In this video I uncover some of the fascinating properties of Pi through algorithms and techniques to approximate and visualise Pi.
Feedback is always appreciated, thank you!
subscribers: 150
Feedback is always appreciated, thank you!
subscribers: 150
Просмотров: 120
Видео
The Fastest Prime Number Algorithm
Просмотров 3 тыс.Месяц назад
In this video I compare the speed of 3 different prime number finding algorithms. All of the code was written in python. There are definitely algorithms faster than those that I've showed in this video, and different algorithms have different advantages and use cases. In this video I only explore 3 of such algorithms - do let me know if you're interested in a video on other prime number algorit...
AI Learns To Parkour
Просмотров 367Месяц назад
In this video Marshy attempts to parkour his way across various obstacles with the use of deep reinforcement learning. This is my first time using unity so forgive me if it looks janky. I made use of unity's ml-agent package to train the ai with deep reinforcement learning. It's brain is made up of 4 layers of 128 hidden units each. It takes in various observations such as its position, rotatio...
Simulating the Monty Hall Problem
Просмотров 98Месяц назад
Today I make a simulation of the Monty Hall problem to find out whether switching doors have any effect. All feedback is well appreciated!
A.I. SOLVES the HARDEST Maze
Просмотров 1,1 тыс.2 месяца назад
In this video I programmed a maze solver using 2 different path finding algorithms. Any feedback is well appreciated! Also thank you to all who took the time to watch, like or comment on my previous video! ^_^
AI makes the WORLD'S HARDEST MAZE
Просмотров 9912 месяца назад
In this video I show myself making an AI algorithm which generates mazes. Feedback is always appreciated!
You look so cute
Hello, mathematician here. Your method is awesome, but you only need to check for divisors up to the floor of sqrt(p), what i mean is, if you wanna check if one thousand is prime, you only need to check if 1000 is divisible by the numbers 2 to 31 (square root of 1000). Hope this helps, this makes it a lot faster.
If you check the code, this was already implemented, just not mentioned verbally
Thanks for the feedback! But yes I did implement this, just not for the first algorithm 😁
Question: Does the respective script exclude numbers ending in 0, 2, 4, 5, 6, 8? Because these are certainly not prime numbers. Where can I get the scripts?
Nope! It does not explicitly exclude those numbers. But when the script is run it’ll naturally figure out that these aren’t primes
@@MarshySyntax The script can be faster. It don't need time for checking 0, 2, 4, 5, 6, 8 if the number has millions of digits.
printing to stdout took way more time than the actual computation itself also there are algorithms that can find all primes under 10^9 in less than a second (in C++)
Pretty good channel! Yes, the high-pitched voice really hurts our ears. Other than that, you've earned a new subscriber!
Thank you!! 🙏🏻
Marsh mallows are cylinder!
That’s true! Pi is in there somewhere
🥧🎨
Sweet! :O (I wonder if marshmallow pies are any good)
😁 I wonder too, but they sure sound good
nice
Thanks!
amzing video!
Thank you!! 😁
underrated channed. this video is so good. Would you like to do more number algorithms showcase like this. I'd love to watch!
Thank you! ☺️
I was late but great video again
😆 Thank you as always!
Great content just change the voice
Thanks for the feedback!
Thank you for the video! I love quick little algorithm comparison showcases. A quick note: on my machine, my own version of the trial division algorithm (up to 1 million) took 12 seconds to run while printing the numbers and just over one second without printing the numbers. This is because system calls (which are required to print to the terminal) are around a thousand times (or more!) slower to run than typical math operations, depending on the language and environment. This also explains why the sieve and trial division algorithms took about the same time for the first million primes, they both spent most of the time printing instead of actually doing math. It's worth keeping this in mind for future comparisons. Again, thank you for the video; I would love to see more naive vs. advanced algorithm implementation comparisons!
Hi! Really glad to hear that you enjoyed the video😊 I’ve also tried the algorithm without printing and realised they were quicker, however I felt like it would be a little more visually interesting if the prime numbers were printed out in the video 😅
The voice is paintful to listen to, but good video
Thank you for that feedback! 😊
@@MarshySyntax no problem
I mean I really would like to see more of the code, but other than that, it's very easy to understand
Thank you! I’ll keep that in mind 🙏🏻
Super easy to understand, would love to see more complex subjects
Thanks! I’ll try to keep them coming!
wtf is this voice
Really good video, however the voice goes straight through me.
Thanks for the feedback! Very much appreciated 🙏🏻
Hi, just a quick question for trial division algorithm why you had calculated square root as limit
Good catch, this was actually an oversight when I made the video. The trial division algorithm actually had the square root as the limit, I just forgot to explain it during the video. Hope that answers your question!
@@MarshySyntax Thanks for the solution!! Btw, very good video!!
Thank you!
it would be great if the voice was a little lower in pitch, but otherwise this is a great video!👍
Thank you for the feedback! 😁
Search for "THE MEISSEL, LEHMER, LAGARIAS, MILLER, ODLYZKO METHOD" It's faster than the sieve of Eratosthenes
I’ll have to give that a look thank you!
We be obtaining security keys used by big internet security firms with this one 🗣️🗣️🗣️🔥🔥🔥🔥💯💯💯
ok..
primes are in P
I thought this is a channel with a million subscribers, really high quality video ,l like it
Thank you! I try my best to make as good videos I can 😊
Nice video! I like your explanations because they are really simple and easy to understand!
Thank you!
Great video as always, i really enjoy watching your videos. Keep the great work up!
Thank you for your support!
The algorithm explanation is genuinely super easy. Great job as always :D Also a quick question; if we use a faster compiling language than python will the time change be noticeable or same?
Thanks!🙏🏻 Yes the time difference if we use a faster language (e.g C/C++) should be noticeable! I just used python because it’s the language I am most familiar with 😁
@@MarshySyntax ah I see. Thanks for answering. Cause I am studying programming so these kinda videos and questions help :D
I think, the main problem with faster algorithms here is results output. Most of the time this code would spend printing the results. If it is true, the way of working with i/o is more important (in terms of performance) than programming language choice
It's probably around 10x the speed
Yes, I actually did this a while back with 3 languages and this sieve. Nodejs, C++, and Python Also, a quick note, these tests were automated back to back, mixing the order. along with that I did not have each number printed into the console because printing, especially on Windows, is slow. On going to 1m, and averaged over 5 times, the times were: Python: 1797.4 ms Node: 149.8 ms (12x faster) C++: 46.7 ms (38.4x faster) then for 10m, again averaged over 5 times: Python: 23752.1 ms Node: 1214.1 ms (19.6x faster) C++: 699.8 ms (33.9x faster) Also, here are the peak ram usages going from the 1m run, then 10m run, were Python: 86.7 mb, 772.9 mb Node: 36.6 mb, 119.7 mb C++: 4.9 mb, 15.6 mb C++ is so much better here btw because I used bit arrays (std::vector<bool>), basically each number bool takes up a single bit in the array. (this is how the sieve works btw)
This is cool
Thanks!
How is the voice created
I really enjoyed video. Could you please share the source code ? It would be really helpful to see how you implemented it. Also, if possible, could you provide a brief demonstration of how to run the code? Keep up the good work ,thanks a lot!"
Hi, glad to hear that you enjoyed the video! The source code is so messy so I don’t think I’ll show it 😅 However if you’re interested, perhaps some time in the future I’ll make a tutorial on how to get started with ml-agents for ai reinforcement learning 😄
What input change is it waiting for in Level 3? surely if its standing still it would continue to output the stand still command? (unless there's a timer input or the raycasts are semi random? maybe the outputs are only allowed to change every so often and its waiting for the next output cycle??)
One thing I did was set the ai to only request a decision every 20 academy steps. However I think where the ‘waiting’ mostly came from was lag - sometimes the programme would freeze for a second or two when I was recording it because I had many simultaneous environments in the background. However I changed this in level 4 onwards so it would lag less. Hope this helps! :D
The budget increased let's go!!!
Haha 😁
great video again :D
Thank you! 🙏🏻
The Monty Hall problem as stated is a one time event. If you want to simulate it, you need to make further assumptions first. For this simulation, you assumed the host would always offer the switch. If the host only sometimes offered the switch, the simulation would look different and the result would be a different one.
What the hell are you talking about? These events aren't connected, you're just doing the same "one time event", where you ARE offered a switch, 1000 times. That's literally how probabilities work. The situation where you only get to swap "sometimes" (when?) is a different thing entirely that you haven't even described properly.
@@AbiSaysThings no, it's not, because there's obviously a human being involved (the host) whose behavior isn't specified. Unlike a dice that predictably will roll 1 through 6 on average 1/6 of the time, with a human there's no telling what will happen next time. To assume that the same thing will and must happen is rather naive.
@@insignificantfool8592bro your name is spitting fact's
@@Bacon2000. You're not really trying to say the behavior of the host us properly specified? Because it isn't.
great video as always
Thank you! 🙏🏻🙏🏻 I appreciate your continuous support ☺️
great video marshy!
Thank you!
save marshy!!😫 keep up the good content!
Thank you!! ☺️
already did :D
Thanks for being so supportive!
@@MarshySyntax no problem
I wish I knew to code like that
There are a lot of great resources out there to learn how :D
999 947 subscribers left
Almost there! 😅
00:35 I hate that dusty sponge!!!!!!!
It’s a cracker! I got turned into a S’more 😢
Sandwich marshmallow
Awesome video keep the great work up! 👍👏❤
Thanks for the kind words!
another great video. keep up the good work!
Thank you for the support! 😊
NOOOOO MARSHYYYYYYYY!!!!! awesome video :p
Thanks! Haha don't worry I'm all well and good! :D
Im 50th sub, nice :D
Thank you!
its not ai ... everyone needs to stop using that buzzword.. its just an algorithm thats all
Thanks for the feedback!
chey marshmallow can't wait for your new video
Good Video
Thank you!
Amazing video, please don't show programming in small window, maybe anyone wanna see code in process. Good luck.
Thanks for the feedback! I'll keep that in mind :D
yes, this guy is gonna be popular