Abstract
Random walks have been created using the pseudo-random generators in different computer language compilers (BASIC, PASCAL, FORTRAN, C++) using a Pentium processor. All the obtained paths have apparently a random behavior for short walks (∼2 14 steps). From long random walks (2 33 steps) different periods have been found, the shortest being 2 18 for PASCAL and the longest 2 31 for FORTRAN and C++, while BASIC had a 2 24 steps period. The BASIC, PASCAL and FORTRAN long walks had even (2 or 4) symmetries. The C++ walk systematically roams away from the origin. Using deviations from the mean-distance rule for random walks, 〈 d 2〉∝ N, a more severe criterion is found, e.g. random walks generated by a PASCAL compiler fulfills this criterion to N< 10 000 .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
