Choose an application

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

Computer science --- 681.3*F11 --- 681.3*F42 --- 681.3*F41 --- 681.3*I22 --- 681.3*D31 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- 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} --- 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} --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} --- Rewriting systems (Computer science) --- Rewriting systems (Computer science). --- 681.3*D31 Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} --- 681.3*I22 Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- 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*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*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Graph rewriting systems (Computer science) --- Term rewriting systems (Computer science) --- Machine theory

Choose an application

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

Lambda calculus. --- Rewriting systems (Computer science) --- Machine theory. --- Lambda-calcul --- Systèmes de réécriture (Informatique) --- Automates mathématiques, Théorie des --- Lambda calculus --- Machine theory --- Mathematical Theory --- Mathematics --- Physical Sciences & Mathematics --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Graph rewriting systems (Computer science) --- Term rewriting systems (Computer science) --- Calculus, Lambda --- Computer science. --- Computer logic. --- Mathematical logic. --- Artificial intelligence. --- Computer Science. --- Mathematical Logic and Formal Languages. --- Logics and Meanings of Programs. --- Artificial Intelligence (incl. Robotics). --- Mathematical Logic and Foundations. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Logic, Symbolic and mathematical --- Informatics --- Science --- Algorithms --- Recursive functions --- Robotics --- Logic design. --- Logic, Symbolic and mathematical. --- Artificial Intelligence. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Formal Languages and Automata Theory. --- Computer Science Logic and Foundations of Programming.

Choose an application

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

Mathematical logic --- Computer science --- Artificial intelligence. Robotics. Simulation. Graphics --- programmeren (informatica) --- wiskunde --- logica --- robots