Complexity suggests that relationships between parts are more important than the parts themselves. This leads to assumptions such as: Neither the system nor its external environment are, or ever will be, constant - emergence and natural creativity are the norm.
Implicit computational complexity (ICC) is a subfield of computational complexity theory that characterizes algorithms by constraints on the way in which they are constructed, without reference to a specific underlying machine model or to explicit bounds on computational resources unlike conventional complexity theory. ICC was developed in the 1990s and employs the techniques of proof theory, substructural logic, model theory and recursion theory to prove bounds on the expressive power of high-level formal languages. ICC is also concerned with the practical realization of functional programming languages, language tools and type theory that can control the resource usage of programs in a formally verifiable sense.
U.S/British physicist on complex systems
Neil Fraser Johnson is an English physicist who is notable for his work in complexity theory and complex systems, spanning quantum information, econophysics, and condensed matter physics. He is currently Professor of Physics at George Washington University in Washington D.C. where he heads up a new initiative in Complexity and Data Science which combines cross-disciplinary fundamental research with data science, with a view to resolving complex real-world problems.
Complexity theory neil
American theoretical computer scientist
Neil Immerman is an American theoretical computer scientist, a professor of computer science at the University of Massachusetts Amherst. He is one of the key developers of descriptive complexity, an approach he is currently applying to research in model checking, database theory, and computational complexity theory.
