Abstract
This paper deals with mutual comparison of different pseudorandom number generators and its impact on the performance of selected algorithms of the symbolic regression. In this paper we discuss the use of genetic programming (GP) with use of chaotic systems as well as its main attributes and universal features. It is also explained why deterministic chaos is used and compared here with standard pseudorandom number generators. Based on the characterization of deterministic chaos, universal features of that kind of behavior are explained. In the second part of the paper we discuss selected examples of GP powered by deterministic chaos and classical pseudorandom number generators and its results.
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 callDisclaimer: 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.
