Choose an application

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

Mathematical logic --- Gödel, Kurt --- Gödel's theorem. --- Gödel's theorem --- Gödel's incompleteness theorem --- Undecidable theories --- Arithmetic --- Completeness theorem --- Incompleteness theorems --- Logic, Symbolic and mathematical --- Number theory --- Decidability (Mathematical logic) --- Foundations

Choose an application

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

Programming --- Computer science --- Machine theory --- Computational complexity --- Automates mathématiques, Théorie des --- Complexité de calcul (Informatique) --- Machine theory. --- Computational complexity. --- #TELE:SISTA --- 681.3*F --- 681.3*F13 --- 681.3*F41 --- 681.3*F42 --- 681.3*F43 --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Complexity, Computational --- Electronic data processing --- Theory of computation --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F43 Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F42 Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F Theory of computation --- Automates mathématiques, Théorie des --- Complexité de calcul (Informatique)