Does True Randomness Actually Exist?
May imply recursivity in some way? Mind you, didn't watch the vid.
It's an excellent video about a fascinating mathematical fact. I am not sure the treatment of infinite objects would be in your wheelhouse, so to speak. But it could help your understanding if you watched it with the right attitude.
The wonderful central fact is that there is only one random graph (with a very general definition of what that is - something that could be made a tad clearer in the video, to be frank! To be fair, he does give two constructions and shows they are the same with probability 1).
The Rado Graph (also known as "the random graph")
[One more precise statement of the "there's only one random graph" theorem is as follows:
If you construct a graph by starting with a countable set of points and randomly connected each pair of points with some probability 0 < p < 1, then, with probability 1, you get the same graph to within isomorphism. For clarity, two graphs are isomorphic if there is a 1-1 mapping between their sets of vertices that preserves the property of two vertices being connected or not ].
TROGDOR!!!! TROGDOR!!!! Trogdor was a man!!!! I mean...he was a dragon man!!!! Er...maybe he was just a dragon!!!! Um...but he was still TROGDOR!!!! TROGDOR!!!! Burninating the country side!!!! Burninating the peasants!!!! Burninating all the people and the thatched roof COTTAAAAAAAGES!!!! THATCHED ROOF COTTAAAAAAAGES!!!! And the trogdor comes in the NIIIIIIIIIIIIIIIIGHT!!!!!!!
May imply recursivity in some way? Mind you, didn't watch the vid.
It's an excellent video about a fascinating mathematical fact. I am not sure the treatment of infinite objects would be in your wheelhouse, so to speak. But it could help your understanding if you watched it with the right attitude.
The wonderful central fact is that there is only one random graph (with a very general definition of what that is - something that could be made a tad clearer in the video, to be frank! To be fair, he does give two constructions and shows they are the same with probability 1).
The Rado Graph (also known as "the random graph")
[One more precise statement of the "there's only one random graph" theorem is as follows:
If you construct a graph by starting with a countable set of points and randomly connected each pair of points with some probability 0 < p < 1, then, with probability 1, you get the same graph to within isomorphism. For clarity, two graphs are isomorphic if there is a 1-1 mapping between their sets of vertices that preserves the property of two vertices being connected or not ].
Reminder to me to reread this post.