For true randomness, it is. Therefore there are only a finite. The discussion centers on estimating the probability that a random string of a given length is a word in a specific language, such as english.
If sp2 is omitted, that is probably where the program encounters and unexpected eof since it would.
Using random number generator 1, initial seed = 19073486328125 imcn is done dump 1 on file cc4r nps = 0 coll = 0 ctm = 0.00 nrn = 0 xact is done cp0 = 0.01 run. If random number generators told you what have happened, then two random number generators would tell the same tale with more (or less) then 50 % accuracy. I'm running mcnp6 via mcnpx visual. Si2 needs a corresponding sp2 with the same number of entries.
Random number generators, as normally thought of, are programs on digital computers, where numbers have a finite number of bits. The discussion revolves around the nature of randomness and determinism in the universe, questioning whether true randomness exists or if everything is ultimately.
