Computational Complexity Theory - Continuous Complexity Theory

Continuous Complexity Theory

Continuous complexity theory can refer to complexity theory of problems that involve continuous functions that are approximated by discretizations, as studied in numerical analysis. One approach to complexity theory of numerical analysis is information based complexity.

Continuous complexity theory can also refer to complexity theory of the use of analog computation, which uses continuous dynamical systems and differential equations. Control theory can be considered a form of computation and differential equations are used in the modelling of continuous-time and hybrid discrete-continuous-time systems.

Read more about this topic:  Computational Complexity Theory

Famous quotes containing the words continuous, complexity and/or theory:

    We read poetry because the poets, like ourselves, have been haunted by the inescapable tyranny of time and death; have suffered the pain of loss, and the more wearing, continuous pain of frustration and failure; and have had moods of unlooked-for release and peace. They have known and watched in themselves and others.
    Elizabeth Drew (1887–1965)

    In times like ours, where the growing complexity of life leaves us barely the time to read the newspapers, where the map of Europe has endured profound rearrangements and is perhaps on the brink of enduring yet others, where so many threatening and new problems appear everywhere, you will admit it may be demanded of a writer that he be more than a fine wit who makes us forget in idle and byzantine discussions on the merits of pure form ...
    Marcel Proust (1871–1922)

    Could Shakespeare give a theory of Shakespeare?
    Ralph Waldo Emerson (1803–1882)