Choose an application

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

Electronic data processing --- Recursive functions --- Computable functions --- Informatique --- Fonctions récursives --- Fonctions calculables --- Fonctions récursives --- Fonctions calculables. --- Decidability (Mathematical logic) --- Recursive functions. --- Turing machines. --- Formal languages --- Computable functions. --- Décidabilité (logique mathématique) --- Langages formels. --- Fonctions récursives. --- Automates mathématiques, Théorie des. --- Turing, Machines de. --- Computer science --- Décidabilité (logique mathématique) --- Fonctions récursives. --- Automates mathématiques, Théorie des.

Choose an application

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

This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance. The book includes a wealth of results - classical, recent, and others which have not been published before.In developing the mathematics underlying the size, dynamic and structural complexity measures, various connections with mathematical logic, constructive topology, probability and programming theories are established. The facts are presented in detail. Extensive examples are provided, to help clarify notions and construct

Discrete mathematics --- Informatique --- Computer science --- Computational complexity. --- Algebra. --- Computational Complexity --- Mathematics --- Mathematical analysis --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computer science. --- Logique mathématique --- Récursivité, Théorie de la --- Logique mathematique --- Algorithmique --- Fonctions recursives --- Complexite

Choose an application

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

Recursion theory --- Théorie de la récursivité --- 681.3*D22 --- Logic, Symbolic and mathematical --- Tools and techniques: decision tables; flow charts; modules and interfaces; programmer workbench; software libraries; structured programming; top-down programming; user interfaces (Software engineering) --- Recursion theory. --- 681.3*D22 Tools and techniques: decision tables; flow charts; modules and interfaces; programmer workbench; software libraries; structured programming; top-down programming; user interfaces (Software engineering) --- Recursive functions --- Récursivité, Théorie de la --- Fonctions récursives --- Récursivité, Théorie de la. --- Fonctions récursives. --- Récursivité, Théorie de la. --- Fonctions récursives.

Choose an application

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

Mathematical logic --- Constructive mathematics --- Recursive functions --- Unsolvability (Mathematical logic) --- Degrees of unsolvability --- Turing degrees of unsolvability --- Functions, Recursive --- Algorithms --- Arithmetic --- Logic, Symbolic and mathematical --- Number theory --- Recursion theory --- Decidability (Mathematical logic) --- Mathematics, Constructive --- Foundations --- Recursive functions. --- Constructive mathematics. --- Mathématiques constructives. --- Fonctions récursives. --- Non-résolubilité (logique mathématique)

Choose an application

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

Computable functions --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Constructive mathematics --- Decidability (Mathematical logic) --- Recursive Functions --- Recursive functions --- Functions, Recursive --- Algorithms --- Arithmetic --- Logic, Symbolic and mathematical --- Number theory --- Recursion theory --- Foundations --- Logique mathématique --- Récursivité, Théorie de la --- Logique mathematique --- Fonctions recursives