Art of the Problem I genuinely appreciate this step you took! I wish professors had this sort of revelation. The biggest problem I have is with understanding all the 1000 notations in one paragraph, when someone speaks it out in plain English, it's so much better! Even though I can't pay you, I will give you credit when my exam results come back :P Thanks!
What is possible vs what is possible in reasonable amount of time is really good comparison both real life and computer science. The most encouraging video I have ever seen about randomness.
Wow, what a coincidence me and my friend the other day were having a discussion about how a computer can generate a random number, we tried looking at some confusing algorithm, but this video explains it perfectly. Thanks so much!
so essentially a random number generator can be defined as a way to generate a sequence that will never repeat. how can you even prove such thing exists if for all that we know that it didn't repeat yet? besides, is an RNG with uneven distribution still random?
The dullest reading book I own is a pdf of the Rand Corporation's tome "A Million Random Digits", but exploring it is like getting a glimpse of some fundemental natural process as old as the stars.
best viedeo in my entire stduies-life... never thought i would call cryptography and maths beautiful, but these videos in a row make me say it and think it
John von Neumann's last name is pronounced von NOY-man. (You can verify this by looking him up in Wikipedia. The International Phonetic Alphabet (IPA) representation of his name is given as /vɒn ˈnɔɪmən/ --- where ɔɪ sounds like the "oy" in "boy.")
If it is small closed system you probably can predict it bit if it is big system, or if you are part of that system prediction is impossible because part of some thing cant fit data of whole thing. You will run out of memory before it will start repeating itself. or alternatively you will need to simulate whole thing inside of some limited model.
A manipulation of the machine is not required. It is just that the [fixed] algorithm eventually finds itself back at the original seed, from there everything repeats.
To be more clear on my question below could ,say a text file, be instead be replaced by a (hopefully?) smaller file that is just a special random generation function , seed, ect that after a (hopefully?) short amount of time will spit out the original text file ? My personal guess is that there are a few (seemingly?) random text files that could be derived from a specific psuedo-random function,seeds,ect but then that function for a given text file would be are hard to discover/calculate. I really doubt that I'm the only one that has come up with this idea for data compression so there is probably some major flaw with this plan ; can anybody tell me why it doesn't seemed to be used?
I guess it's possible. Library of Babel has every book that existed/exists/will exist with limits of, afair, 3200 words/letters (there are some other limits but you can read it in the "theory" section). libraryofbabel.info/search.cgi
Do people try to use psuedo-random functions to try to compress (like in .zip files) what often appears to be random bytes in pretty much all types of data files ( like .txt files , .bmp, .mp3, .exe, ect. )? If not then does anybody know the main reason(s) why that isn't (often?) done ?
So when you call a rand method in code, where does the seed come from? Maybe CPU temperature, but then that is no longer random, and breaks the randomness...
SteepVisions Some programming languages(in low and high level, such as Python and C) allow you to insert the seed yourself. It's usually easiest to use the on-going timers(or NTP), but you can use unallocated memory or floating ADC if hardware is accessible.
SteepVisions Some programming languages use the same seed every time. So that running the same program twice will generate the same output. This is desirable because it's harder to debug programs that do different things each time you run them. But they usually provide an option to set the seed yourself. In which case you can set it to something like the current time. This isn't good enough for cryptography though. If you are doing cryptography, you will probably want to use special software that creates a seed from as many different sources as possible. The time, the location of the user's mouse, special hardware RNGs if the computer has one, etc.
Randomness is a state of the inability to be predicted given reasonable amounts of time. In truth, there is no such thing as "random" since all things follow rules and a certain "order." What we call 'random" is simply just something utterly complicated or relying on unnoticeable things that we cannot predict it. Randomness is concept. A good example of something that's "random" could be air turbulence.
Can anything be truly really impossible to determine (100%) random? I don't think so, it may seem completely random, but all that means is that it is really hard to predict, not impossible. In an unlimited amount of time anything will repeat, I think that you can only approach 100% randomness, never quite perfect.
The explanation in this video did what 150 minutes of a lecture per week (for 3 months) didn't do.
Priyanka Alexander ha! perfect. I also sat through those lectures....and one day I just decided something needed to be done
Art of the Problem I genuinely appreciate this step you took! I wish professors had this sort of revelation. The biggest problem I have is with understanding all the 1000 notations in one paragraph, when someone speaks it out in plain English, it's so much better! Even though I can't pay you, I will give you credit when my exam results come back :P Thanks!
Art of the Problem So what if I did this in (C++).
If (Random == startingNum)
{
startingNum = startingNum+1;
Seed = StartingNum;
}
+Priyanka Alexander LOL Where do you study?
What is possible vs what is possible in reasonable amount of time is really good comparison both real life and computer science.
The most encouraging video I have ever seen about randomness.
this video got intense quickly
I've never subscribed to a channel so quickly
welcome to the family :)
What happens? What the hell happens when they can never share their random seed? WTF?
"Tune in for Episode 2, of John sharing his seed w/ Judy...."
:)
These videos are just golden. Thank you for uploading them.
Wow, what a coincidence me and my friend the other day were having a discussion about how a computer can generate a random number, we tried looking at some confusing algorithm, but this video explains it perfectly. Thanks so much!
mind blown overload
so essentially a random number generator can be defined as a way to generate a sequence that will never repeat. how can you even prove such thing exists if for all that we know that it didn't repeat yet? besides, is an RNG with uneven distribution still random?
Nothing in this life is random yet only complicated.
The dullest reading book I own is a pdf of the Rand Corporation's tome "A Million Random Digits", but exploring it is like getting a glimpse of some fundemental natural process as old as the stars.
26^20 aha? why not 10^20. Makes no sense why all of the sudden the alphabet plays a role here.
best viedeo in my entire stduies-life... never thought i would call cryptography and maths beautiful, but these videos in a row make me say it and think it
thrilled to hear it :)
Very nice video, Application of PRN in encrypting data has paved way for very efficient techniques.
what is the definition of "pattern" in your definition? self similiarity or periodic repeating?
Greatly explained! I always wondered the difference between Pseudo and Real RNG. Yays!
is this how minecraft 'seeds' work?
John von Neumann's last name is pronounced von NOY-man.
(You can verify this by looking him up in Wikipedia. The International Phonetic Alphabet (IPA) representation of his name is given as /vɒn ˈnɔɪmən/ --- where ɔɪ sounds like the "oy" in "boy.")
I felt like I just took a course on encryption.
If it is small closed system you probably can predict it bit if it is big system, or if you are part of that system prediction is impossible because part of some thing cant fit data of whole thing. You will run out of memory before it will start repeating itself. or alternatively you will need to simulate whole thing inside of some limited model.
This video seems to abruptly end. What is the next video called, and where can I find it?
I'd even say it's the most random end I've ever seen
A manipulation of the machine is not required. It is just that the [fixed] algorithm eventually finds itself back at the original seed, from there everything repeats.
Can the GetHashCode function on c# or java be considered a pseudorandom function?
To be more clear on my question below could ,say a text file, be instead be replaced by a (hopefully?) smaller file that is just a special random generation function , seed, ect that after a (hopefully?) short amount of time will spit out the original text file ? My personal guess is that there are a few (seemingly?) random text files that could be derived from a specific psuedo-random function,seeds,ect but then that function for a given text file would be are hard to discover/calculate. I really doubt that I'm the only one that has come up with this idea for data compression so there is probably some major flaw with this plan ; can anybody tell me why it doesn't seemed to be used?
if we can reverse this.... yes
If you think about it thats what hashing must do, and probably how archive compression software works too (winzip, winrar, etc)
I guess it's possible. Library of Babel has every book that existed/exists/will exist with limits of, afair, 3200 words/letters (there are some other limits but you can read it in the "theory" section). libraryofbabel.info/search.cgi
how do you know that the seed chosen is indeed random and not pseudorandom?
Where did you get the number 26^20 from?
Do people try to use psuedo-random functions to try to compress (like in .zip files) what often appears to be random bytes in pretty much all types of data files ( like .txt files , .bmp, .mp3, .exe, ect. )? If not then does anybody know the main reason(s) why that isn't (often?) done ?
but pseudo-random numbers are made, maybe a reverse will heavily compress a file, but it is pretty hard
So when you call a rand method in code, where does the seed come from? Maybe CPU temperature, but then that is no longer random, and breaks the randomness...
SteepVisions sometimes it's gathered from user entripy
SteepVisions
Some programming languages(in low and high level, such as Python and C) allow you to insert the seed yourself. It's usually easiest to use the on-going timers(or NTP), but you can use unallocated memory or floating ADC if hardware is accessible.
At least in c++ you can do a seed(time); for a rand() function you can put what ever you want as the seed as long as you can get the number.
SteepVisions Some programming languages use the same seed every time. So that running the same program twice will generate the same output. This is desirable because it's harder to debug programs that do different things each time you run them.
But they usually provide an option to set the seed yourself. In which case you can set it to something like the current time. This isn't good enough for cryptography though. If you are doing cryptography, you will probably want to use special software that creates a seed from as many different sources as possible. The time, the location of the user's mouse, special hardware RNGs if the computer has one, etc.
Do you want to talk on AIM by any chance?
Thanks! I was always wondering how computers did it. But I see that random numbers are never totally, totally random.
the dice is random, but numbers that someone thinks are not
Fivos Capone How do you mean? And you know that _dice_ is plural?
@@fivoscapone9377 how do you know if something is random? for all i know you can only know if something isn't random.
The narrator sounds like David Van Driessen.
I keep expecting him to bust out singing "Lesbian Seagull".
I thought I was smart until I watched this @--@
These vids are great!
It seems that the seed is from {a,b,c,...y,z}^20. This is the logical gap at 4:10.
Yeah science!:)
What is an example of pure Randomness? If it does exist?
Randomness is a state of the inability to be predicted given reasonable amounts of time. In truth, there is no such thing as "random" since all things follow rules and a certain "order." What we call 'random" is simply just something utterly complicated or relying on unnoticeable things that we cannot predict it.
Randomness is concept.
A good example of something that's "random" could be air turbulence.
Quantum stuff is pure random
great use of random walk!!
(remember me?)
Can anything be truly really impossible to determine (100%) random? I don't think so, it may seem completely random, but all that means is that it is really hard to predict, not impossible. In an unlimited amount of time anything will repeat, I think that you can only approach 100% randomness, never quite perfect.
This is a fine exposition. Except that there is a logical gap at 4:10 -- please patch it.
Can anyone please better explain message space?
+Anurag Baundwal all possible messages? check out the whole series in order
+Brit Cruise Thanks! I did, but it's just a little confusing.
+Anurag Baundwal Hey that means you are actually thinking about it. that's the key!
:D
Subscribed
Thanks for Japanese sub lol
no such thing as art about it or problemx, do/can do any nmw and it can all b perf. can say anyx by anyx nmw