1887
banner image
No data available.
Please log in to see this content.
You have no subscription access to this content.
No metrics data to plot.
The attempt to load metrics for this article has failed.
The attempt to plot a graph for these metrics has failed.
f
Introduction to Focus Issue: Intrinsic and Designed Computation: Information Processing in Dynamical Systems—Beyond the Digital Hegemony
Rent:
Rent this article for
Access full text Article
/content/aip/journal/chaos/20/3/10.1063/1.3492712
1.
1.G. E. Moore, “Cramming more components onto integrated circuits,” Electronics 38, 56 (1965).
2.
2.G. E. Moore, “Progress in digital integrated electronics,” Tech. Dig. - Int. Electron Devices Meet. 1975, 11.
3.
3.G. E. Moore, “Lithography and the future of Moore’s law,” Proc. SPIE 2437, 1 (1995).
4.
4.P. McCorduck, Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence, 2nd ed. (A.K. Peters, Natick, MA, 2004).
5.
5.C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J. 27, 379 (1948).
6.
6.C. E. Shannon, “Communication theory of secrecy systems,” Bell Syst. Tech. J. 28, 656 (1949).
7.
7.C. E. Shannon, “Prediction and entropy of printed English,” Bell Syst. Tech. J. 30, 50 (1951).
8.
8.A. N. Kolmogorov, “A new metric invariant of transient dynamical systems and automorphisms in Lebesgue spaces,” Dokl. Akad. Nauk SSSR 119, 861 (1958)
8.A. N. Kolmogorov, “(Math. Rev. 21, 2035a).
9.
9.A. N. Kolmogorov, “Entropy per unit time as a metric invariant of automorphisms,” Dokl. Akad. Nauk SSSR 124, 754 (1959)
9.A. N. Kolmogorov, “(Math. Rev. 21, 2035b).
10.
10.Ja. G. Sinai, “On the notion of entropy of a dynamical system,” Dokl. Akad. Nauk SSSR 124, 768 (1959).
11.
11.M. Li and P. M. B. Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications (Springer-Verlag, New York, 1993).
12.
12.D. S. Ornstein, Ergodic Theory, Randomness, and Dynamical Systems (Yale University Press, New Haven, CT, 1974).
13.
13.D. S. Ornstein, “Ergodic theory, randomness, and chaos,” Science 243, 182 (1989).
http://dx.doi.org/10.1126/science.243.4888.182
14.
14.The isomorphism problem was part of the constructivist program in mathematics laid out by D. Hilbert in 1900.
15.
15.R. J. Solomonoff, “A formal theory of inductive control,” Inf. Control. 7, 224 (1964).
http://dx.doi.org/10.1016/S0019-9958(64)90131-7
16.
16.A. N. Kolmogorov, “Three approaches to the concept of the amount of information,” Probl. Inf. Transm. 1, 1 (1965).
17.
17.G. J. Chaitin, “On the length of programs for computing finite binary sequences,” J. ACM 13, 547 (1966).
http://dx.doi.org/10.1145/321356.321363
18.
18.P. Martin-Löf, “The definition of random sequences,” Inf. Control. 9, 602 (1966).
http://dx.doi.org/10.1016/S0019-9958(66)80018-9
19.
19.A. N. Kolmogorov, “Combinatorial foundations of information theory and the calculus of probabilities,” Russ. Math. Surveys 38, 29 (1983).
http://dx.doi.org/10.1070/RM1983v038n04ABEH004203
20.
20.A. M. Turing, “On computable numbers, with an application to the Entsheidungsproblem,” Proc. Lond. Math. Soc. Ser. 2 42, 230 (1936).
http://dx.doi.org/10.1112/plms/s2-42.1.230
21.
21.N. Wiener, Extrapolation, Interpolation, and Smoothing of Stationary Time Series (Wiley, New York, 1949).
22.
22.N. Wiener, Norbert Wiener, Collected Works III (MIT, Cambridge, MA, 1981).
23.
23.F. Conway and J. Siegelman, Dark Hero of the Information Age: In Search of Norbert Wiener—Father of Cybernetics (Basic, New York, 2004).
24.
24.N. Wiener, Cybernetics: Or Control and Communication in the Animal and the Machine (MIT, Cambridge, MA, 1948).
25.
25.N. Wiener, The Human Use of Human Beings: Cybernetics and Society (Da Capo, Cambridge, MA, 1988).
26.
26.W. Weaver, “Science and complexity,” Am. Sci. 36, 536 (1948).
27.
27.A. N. Whitehead, Process and Reality, corrected edition (The Free Press, New York, 1978).
28.
28.E. Schrodinger, What is Life? The Physical Aspect of the Living Cell (Cambridge University Press, Cambridge, England, 1944).
29.
29.M. Adams, A. Hurtado, D. Labukhin, and I. Henning, “Nonlinear semiconductor lasers and amplifiers for all-optical information processing,” Chaos 20, 037102 (2010).
30.
30.C. S. Calude, E. Calude, and K. Svozil, “The complexity of proving chaoticity and the Church-Turing thesis,” Chaos 20, 037103 (2010).
31.
31.F. Chatelin, “Numerical information processing under the global rule expressed by the Euler-Riemann function defined in the complex plane,” Chaos 20, 037104 (2010).
32.
32.J. Crutchfield, C. Ellison, R. James, and J. Mahoney, “Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation,” Chaos 20, 037105 (2010).
33.
33.R. Dar, D. Karig, J. Cooke, C. Cox, and M. Simpson, “Distribution and regulation of stochasticity and plasticity in Saccharomyces Cerevisiae,” Chaos 20, 037106 (2010).
34.
34.W. Ditto, A. Miliotis, K. Murali, S. Sinha, and M. Spano, “Chaogates: Morphing logic gates designed to exploit dynamical patterns,” Chaos 20, 037107 (2010).
35.
35.R. Harmer, V. Danos, J. Feret, J. Krivine, and W. Fontana, ‘‘Intrinsic information carriers in combinatorial dynamical systems,’’ Chaos 20, 037108 (2010).
36.
36.J. Lizier, M. Prokopenko, and A. Zomaya, ‘‘Information modification and particle collisions in distributed computation,’’ Chaos 20, 037109 (2010).
37.
37.J. Propp, “Discrete analog computing with rotor-routers,” Chaos 20, 037110 (2010).
38.
38.S. Still, J. Crutchfield, and C. Ellison, “Optimal causal inference: Estimating stored information and approximating causal architecture,” Chaos 20, 037111 (2010).
39.
39.H. Siegelmann and L. Holzman, “Computing adaptive Bayesian inference from multiple sources,” Chaos 20, 037112 (2010).
40.
40.H. Teramoto and T. Komatsuzaki, “How does a choice of Markov partition affect the resultant symbolic dynamics?,” Chaos 20, 037113 (2010).
41.
41.K. Wiesner, “Nature computes: Information processing in quantum dynamical systems,” Chaos 20, 037114 (2010).
http://aip.metastore.ingenta.com/content/aip/journal/chaos/20/3/10.1063/1.3492712
Loading
/content/aip/journal/chaos/20/3/10.1063/1.3492712
Loading

Data & Media loading...

Loading

Article metrics loading...

/content/aip/journal/chaos/20/3/10.1063/1.3492712
2010-09-28
2014-09-18

Abstract

How dynamical systems store and process information is a fundamental question that touches a remarkably wide set of contemporary issues: from the breakdown of Moore’s scaling laws—that predicted the inexorable improvement in digital circuitry—to basic philosophical problems of pattern in the natural world. It is a question that also returns one to the earliest days of the foundations of dynamical systems theory, probability theory, mathematical logic, communication theory, and theoreticalcomputer science. We introduce the broad and rather eclectic set of articles in this Focus Issue that highlights a range of current challenges in computing and dynamical systems.

Loading

Full text loading...

/deliver/fulltext/aip/journal/chaos/20/3/1.3492712.html;jsessionid=10ea3ltjc9b1l.x-aip-live-06?itemId=/content/aip/journal/chaos/20/3/10.1063/1.3492712&mimeType=html&fmt=ahah&containerItemId=content/aip/journal/chaos
true
true
This is a required field
Please enter a valid email address
This feature is disabled while Scitation upgrades its access control system.
This feature is disabled while Scitation upgrades its access control system.
752b84549af89a08dbdd7fdb8b9568b5 journal.articlezxybnytfddd
Scitation: Introduction to Focus Issue: Intrinsic and Designed Computation: Information Processing in Dynamical Systems—Beyond the Digital Hegemony
http://aip.metastore.ingenta.com/content/aip/journal/chaos/20/3/10.1063/1.3492712
10.1063/1.3492712
SEARCH_EXPAND_ITEM