Epstein Secrets

ake c to denote algorithmic information measured on some reference Turing machine, and F(X) to denote what appears on the second tape of a two-tape Turing machine t time-steps after placing X on its first tape. Other more naturalistic computational models are also possible here and are discussed extens

rchitectures 73 4.4.1 Neural versus Symbolic; Global versus Local 75 4.5 Globalist versus Localist Representations 78 4.5.1 CLARION 79 4.5.2 The Society of Mind and the Emotion Machine 80 4.5.3 DUAL 80 4.5.4 4D/RCS 81 4.5.5 PolyScheme 82 4.5.6 Joshua Blue 83 4.5.7 LIDA 84 4.5.8 The Global Work

take c to denote algorithmic information measured on some reference Turing machine, and F(X) to denote what appears on the second tape of a two-tape Turing machine ¢ time-steps after placing X on its first tape. Other more naturalistic computational models are also possible here and are discussed extensi

.............. 002.000 00- 75 4.5 Globalist versus Localist Representations ............0...00 00 eee eee eee 78 4.5.1 CLARION ..... 0.0.0.0 79 4.5.2 The Society of Mind and the Emotion Machine ...................... 80 AB JDUUAD: sms cass SecEE ShFE SESE 48 SHEMG THEW CSTE S SRPMS EME OeE mE SR 80 ABA AD/RCS o.oo ccc

ere? A dim, honest, slow-multiplying human? Impossible to tell. The distinction between machine and man blurred a bit. Buried in the very premise of Turing’s test was an assumption about what machines could do, and how they might do it. “The idea behind digital computers may be explained by saying that t

ore than finding”: Marina Keegan, The Opposite of Lonelinenss”, Yale Daily News, May 27, 2012 (accessed online). 208 “Good theories”: Marvin Minsky, The Society of Mind (New York: Simon & Schuster, 1986) 209 "In a distributed system”: Leslie Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System”

g. This is not so different from Marvin Minsky’s Society of Mind theory, which holds that mind is a collection of

aphor and analogy. It moves from Boolean algebra through topics such as information theory, parallel computing, cryptography, algorithms, heuristics, Turing machines, and promising technologies such as quantum computing and emergent systems. HOUSE_OVERSIGHT_017542 --- PAGE BREAK --- BJARKE INGELS QUINC