On Complexity and Optimization in Emergent Computation
作者： Victor Korotkich
DOI: 10.1007/978-1-4757-3145-3_21
关键词:
摘要: New results on complexity and optimization in emergent computation are presented. The found by using a final mathematical structure based integers only. is collection of hierarchical formations integer relationships. used to suggest concept structural complexity. A principle discuss the specification natural systems terms given. As not subject constraints Turing model computation, problem how it can best be approximated considered. explored for special case reducing binary sequence prediction with as criterion. An optimal algorithm last gives an experimental verification connection period doubling.
springer.com
sci-hub.st 参考文章(7)
Victor Korotkich, Multicriteria Analysis in Problem Solving and Structural Complexity Springer, Boston, MA. pp. 81- 90 ,(1995) , 10.1007/978-1-4757-2383-0_5
Francis Heylighen, Alexander Riegler, Johan Bollen, The evolution of complexity KLUWER ACADEMIC. ,(1999)
Victor Korotkich, A Mathematical Structure for Emergent Computation ,(2014)
W. Brian Arthur, Inductive Reasoning and Bounded Rationality The American Economic Review. ,vol. 84, pp. 406- 411 ,(1994)
Tad Hogg, Bernardo A. Huberman, Colin P. Williams, Phase transitions and the search problem Artificial Intelligence. ,vol. 81, pp. 1- 15 ,(1996) , 10.1016/0004-3702(95)00044-5
Roger Penrose, Peter Hilton, Shadows of the Mind ,(1994)
Steven Weinberg, Frank Wilczek, Dreams of a Final Theory Physics Today. ,vol. 46, pp. 59- 59 ,(1993) , 10.1063/1.2808871