Show simple item record

dc.contributor.advisorHarrison, Gregory
dc.contributor.authorRegensburger, Ryan Scott
dc.date.accessioned2013-11-06T22:03:56Z
dc.date.available2013-11-06T22:03:56Z
dc.date.issued2004-12-14
dc.identifier.citationRegensburger, R.S. (2004). On the use of randomness in computing to perform intelligent tasks (CS-2004-17). Melbourne, FL. Florida Institute of Technology.en_US
dc.identifier.otherCS-2004-17
dc.identifier.urihttp://hdl.handle.net/11141/142
dc.descriptionA thesis submitted to the Florida Institute of Technology in partial fulfillment of the requirements for the degree of Master of Science in Computer Scienceen_US
dc.description.abstractThe study of Artificial Intelligence attempts to simulate the processes of human intelligence in a set of computable algorithms. The purpose of Random Algorithms in this field is to provide a best-guess approach at identifying the unknown. In this thesis, research shows that random algorithms are able to break down many intelligent processes into a set of solvable problems. For example, solving puzzles and playing games involve the same estimating ability shown in standard problems such as the Coupon Collector problem or the Monty Hall problem. This thesis shows Random Algorithmic applications in two overlapping categories of intelligent behavior: Pattern Recognition (to solve puzzles) and Mind Simulation (to play games). The first category focuses on one of the prominent intelligent processes, recognizing patterns from randomness, which the human mind must continually and dynamically perform. The second category deals with simulating the processes of making decisions and solving problems in a more abstract and uncontrolled way, much like the unpredictable human mind.en_US
dc.language.isoen_USen_US
dc.rightsCopyright held by author.en_US
dc.titleOn the use of randomness in computing to perform intelligent tasksen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record