55
Views
13
CrossRef citations to date
0
Altmetric
Original Articles

Nonlinear phenomena in spaces of algorithms

Pages 1449-1476 | Received 25 Feb 2003, Accepted 16 Jun 2003, Published online: 12 May 2010

References

  • Aho A. V. Hopcroft J. E. Ulman J. D. The Design and Analysis of Computer Algorithms Addison-Wesley P.C. Reading Mass (1976)
  • Blum , L. , Shub , M. and Smale , S. (1989) . On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines . Bull. Amer. Math. Soc. , 21 ( 1 ) : 1 – 46 .
  • Burgin M. S. Functional equivalence of operators and parallel computations Programming 6 (1980) 3 16 (translated from Russian)
  • Burgin M. S. Inductive turing machines Notices of the Academy of Sciences of the USSR 270 6 (1983) 1289 1293 (translated from Russian, 27(3))
  • Burgin M. S. Algorithms and algorithmic problems Programming 4 (1985) 3 14 (Programming and Computer Software 11(4)) (translated from Russian)
  • Burgin , M. S. (1995) . The algorithmic approach in the dynamic theory of information . Notices of the Russian Academy of Sciences , 342 ( 1 ) : 7 – 10 .
  • Burgin M. Super-recursive algorithms as a tool for high performance computing In: Proceedings of the High Performance Computing Symposium San Diego (1999) pp. 224–228
  • Burgin , M. (1999a) . A new paradigm for computation and its application to global networks, huge databases, and embedded systems . Data-Link, ACM , 44 : 1 – 2 .
  • Burgin M. Theory of super-recursive algorithms as a source of a new paradigm for computer simulation In: Proceedings of the Business and Industry Simulation Symposium Washington (2000) pp. 70–75
  • Burgin , M. (2001) . How we know what technology can do . Communications of the ACM , 44 ( 11 ) : 82 – 88 .
  • Burgin M. Topological algorithms In: Proceedings of the ISCA 16th International Conference on Computers and their Applications ISCA Seattle, Washington (200la) pp. 61–64
  • Cartwrite , J. H. E. and Piro , O. (1992) . The dynamics of Runge–Kutt methods . International Journal of Bifurcation and Chaos , 2 ( 3 ) : 427 – 450 .
  • Chaitin , G. J. (1977) . Algorithmic information theory . IBM Journal of Research and Development , 21 ( 4 ) : 350 – 359 .
  • Ebbinghaus H.-D. Jacobs K. Mahn F.-K. Hermes H. Turing Machines and Recursive Functions Springer-Verlag Berlin, Heidelberg, New York (1970)
  • Forrest S. (Ed.) Emergent Computation MIT Press Cambridge Massachusetts London England (1991) pp. 1–11
  • Forrest S. Emergent computation: self-organization, collective and cooperative phenomena in natural and artificial computing networks In: Emergent Computation MIT Press Cambridge Massachusetts London England (1991) 1 11
  • Gödel , K. (1931) . Über formal unentscheidbare Sätze der principia mathematics und verwandter system I . Monatshefte für Mathematik und Physik b , 38 : 173 – 198 .
  • Godman A. Payne E. Longman Dictionary of Scientific Usage Longman Group Limited Harlow (1979)
  • Goldin D. Wegner P. Persistent turing machines Brown University Technical Report (1988)
  • Gontar V. New theoretical approach for physicochemical reactions dynamics with chaotic behavior Chaos in Chemistry and Biochemistry World Scientific London (1993) pp. 225–247
  • Gontar , V. (1997) . Theoretical foundation for the discrete dynamics of physicochemical systems: chaos, self-organization, time and space in complex systems . Discrete Dynamics in Nature and Society , 1 ( 1 ) : 31 – 43 .
  • Gontar , V. and Ilin , I. (1991) . New mathematical model of physicochemical dynamics . Contrib. Plasma Physics , 31 ( 6 ) : 681 – 690 .
  • Gray P. Psychology Worth Publishers New York (1994)
  • Haken H. Advanced synergetics: Instability Hierarchies of Self-organizing Systems and Devices Springer New York, Berlin, Tokyo (1983)
  • Hamkins , J. D. and Lewis , A. (2000) . Infinite time turing machines . Journal of Symbolic Logic , 65 ( 3 ) : 567 – 604 .
  • Heath S. Embedded Systems Design Butterworth-Heinemann (1997)
  • Hopcroft J. E. Motwani R. Ullman J. D. Introduction to Automata Theory, Languages, and Computation Addison Wesley Boston, San Francisco, New York (2001)
  • Kleene , S. (1955) . Hierarchies of number theoretic predicates . B. Am. Math. Soc. , 61 : 193 – 213 .
  • Knuth D. The Art of Computer Programming v.2: Seminumerical Algorithms 3rd ed. Addison-Wesley Reading Massachusetts (1997)
  • Li M. Vitanyi P. An Introduction to Kolmogorov Complexity and its Applications Springer-Verlag New York (1997)
  • Machlin R. Stout Q. F. The complex behaviour of machines Emergent Computation MIT Press Cambridge Massachusetts London England (1991) pp. 85–98
  • Nelson , R. J. (1987) . Church's thesis and cognitive science . Notre Dame J. of Formal Logic , 28 ( 4 ) : 581 – 614 .
  • Nicolis J. S. Dynamics of Hierarchical Systems: An Evolutionary Approach Springer New York, Berlin, Tokyo (1986)
  • Palmore J. Herring Ch. Computer arithmetic, chaos and fractals Emergent Computation MIT Press Cambridge Massachusetts London England (1991) pp. 99–110
  • Prigogine I. Form Being to Becoming: Time and Complexity in the Physical Systems San Francisco Freeman and Co. (1980)
  • Rogers H. Theory of Recursive Functions and Effective Computability MIT Press Cambridge Massachusetts (1987)
  • Siegelman H. T. Neural Networks and Analog Computation: Beyond the Turing Limit Birkhauser Berlin (1999)
  • Turing , A. (1936) . On computable numbers with an application to the Entscheidungs-problem . Proc. Lond. Math. Soc. Ser.2 , 42 : 230 – 265 .
  • Zaslavsky G. M. Sagdeev R. A. Usikov D. A. Chernikov A. A. Weak Chaos and Quasi-regular Structures Moscow Nauka (1991) (in Russian)

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.