id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_jnnegfhofvcx3g56x5umiblrk4	Jaakko Kuorikoski	Understanding Nonmodular Functionality: Lessons from Genetic Algorithms	2013	14	.pdf	application/pdf	5095	287	47	Understanding non-modular functionality – lessons from genetic algorithms We analyze the nature of the problems that arise when we try to explain and understand cognitive understanding and apply it to a case problem – solutions generated by genetic algorithms. analyzing the nature of solutions that genetic algorithms present to computational problems, we understanding with a computational application of evolutionary design: problem-solutions often hard to understand is that they can exhibit non-modular functionality, and that breaches of The idea comes originally from Herbert Simon (1962), who claimed that the property of neardecomposability is a necessary condition of understandability to any finite cognitive agent. The problem of understanding causally non-modular systems has received some attention in the demonstrate that design by selection can lead to such non-modular complex behavior. change in one subtask constituting a part of the marker-behavior affects also the functioning possibly ourselves, with behaviors which are functionally non-decomposable and constituted by a 	./cache/work_jnnegfhofvcx3g56x5umiblrk4.pdf	./txt/work_jnnegfhofvcx3g56x5umiblrk4.txt