Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Berekeningen [Ingewikkeldheid van ] --- Calcul [Complexité de ] --- Complexité de calcul --- Computational complexity --- Ingewikkeldheid van berekeningen --- Differential equations --- Integral equations --- Computational complexity. --- Numerical solutions. --- Numerical solutions --- Differential equations - Numerical solutions. --- Integral equations - Numerical solutions.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Berekeningen [Ingewikkeldheid van ] --- Calcul [Complexité de ] --- Complexité de calcul --- Computational complexity --- Ingewikkeldheid van berekeningen --- Cognitive science --- Human information processing --- Sciences cognitives --- Information, Traitement de l', chez l'homme --- Information processing, Human --- Bionics --- Information theory in psychology --- Perception --- Science --- Philosophy of mind --- #A9401W --- Ontwikkelingspsychologie --- cognitieve ontwikkeling --- Cognitive science. --- Human information processing. --- cognitieve ontwikkeling. --- Cognition --- Mathematical models --- Systèmes, Conception de --- System design --- Systèmes, Conception de

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Are mathematical equations the best way to model nature ? For many years it had been assumed that they were. But in the early 1980s, Stephen Wolfram made the radical proposal that one should instead build models that are based directly on simple computer programs. Wolfram made a detailed study of a class of such models known as cellular automata, and discovered a remarkable fact: that even when the underlying rules are very simple, the behavior they produce can be highly complex, and can mimic many features of what we see in nature. And based on this result, Wolfram began a program of research to develop what he called "A Science of Complexity."The results of Wolfram's work found many applications, from the so-called Wolfram Classification central to fields such as artificial life, to new ideas about cryptography and fluid dynamics. This book is a collection of Wolfram's original papers on cellular automata and complexity. Some of these papers are widely known in the scientific community; others have never been published before. Together, the papers provide a highly readable account of what has become a major new field of science, with important implications for physics, biology, economics, computer science and many other areas.

Automates cellulaires --- Berekeningen [Ingewikkeldheid van ] --- Calcul [Complexité de ] --- Cellulaire automaten --- Cellular automata --- Complexité de calcul --- Computational complexity --- Ingewikkeldheid van berekeningen --- Complexité de calcul (Informatique) --- #TELE:SISTA --- Complexité de calcul (Informatique) --- Cellular automata. --- Computational complexity. --- Mathematical models. --- Automates cellulaires. --- Complexité de calcul (informatique) --- Modèles mathématiques. --- Artificial intelligence. Robotics. Simulation. Graphics --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computers, Iterative circuit --- Iterative circuit computers --- Structures, Tessellation (Automata) --- Tessellation structures (Automata) --- Parallel processing (Electronic computers) --- Pattern recognition systems --- Sequential machine theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes

Berekeningen [Ingewikkeldheid van ] --- Calcul [Complexité de ] --- Complexité de calcul --- Computable functions --- Computational complexity --- Fonctions recurrentes --- Functies [Rekenkundige ] --- Ingewikkeldheid van berekeningen --- Logic [Symbolic and mathematical ] --- Logica [Symbolische en wiskundige ] --- Logique symbolique et mathémathique --- Logic, Symbolic and mathematical --- Fonctions calculables --- Complexité de calcul (Informatique) --- Logique symbolique et mathématique --- Computational Complexity --- Logic, symbolic and mathematical --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Constructive mathematics --- Decidability (Mathematical logic) --- Computable functions. --- Computational complexity. --- Logic, Symbolic and mathematical.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book is based on the author's PhD thesis which was selected as the winning thesis of the 1993 ACM Doctoral Dissertation Competition. The author improved the presentation and included the progress achieved since the thesis was approved by the University of California at Berkeley. This work is a fascinating piece of theoretical computer science research building on deep results from different areas. It provides new theoretical insights and advances applicable techniques in such different areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algorithms, NP-complete optimization, and error-detection and error-correction algorithms in coding theory.

Automatic theorem proving --- Berekeningen [Ingewikkeldheid van ] --- Calcul [Complexité de ] --- Complexité de calcul --- Computational complexity --- Ingewikkeldheid van berekeningen --- NP-complete problems --- Theorema's--Automatische bewijsvoering --- Théorèmes--Démonstration automatique --- Computer software. --- Logic design. --- Software engineering. --- Computer science. --- Coding theory. --- Numerical analysis. --- Algorithm Analysis and Problem Complexity. --- Logics and Meanings of Programs. --- Software Engineering. --- Mathematical Logic and Formal Languages. --- Coding and Information Theory. --- Numerical Analysis. --- Software, Computer --- Computer systems --- Mathematical analysis --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Machine theory --- Signal theory (Telecommunication) --- Computer programming --- Informatics --- Science --- Computer software engineering --- Engineering --- Design, Logic --- Design of logic systems --- Electronic circuit design --- Logic circuits --- Switching theory