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
 

Abstract

Nonlinear phenomena, which are so important in nature and society, are considered here in relation to the world of algorithms and computations. To have a mathematical model for this world, formal computability spaces are introduced. It is demonstrated that the traditional approach to algorithms, which is based on such popular models as Turing machines, results in linear subspaces of the computability space. Nonlinear phenomena appear when we go to the more powerful class of such super-recursive algorithms as inductive Turing machines. It is demonstrated how this nonlinearity imports much higher computing power of inductive Turing machines in comparison with conventional Turing machines. This provides a base to consider problems of chaos, emergent computations and infinity from the algorithmic point of view.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.