Listing 1 - 3 of 3 |
Sort by
|
Choose an application
Engineering --- Information Technology --- Mechanical Engineering --- Robotics --- Electrical engineering --- Artificial intelligence. Robotics. Simulation. Graphics --- automatisering --- KI (kunstmatige intelligentie) --- robots --- Robotics. --- Automatic control --- Automation --- Automatisation. --- Robot. --- Robotique. --- Machine theory --- Automatic control. --- Automation. --- AI (artificiële intelligentie)
Choose an application
Artificial life in art. --- Arts, Modern --- Artificial life in art --- Kunstmatig leven in de kunst --- Vie artificielle dans l'art --- 82:7 --- Mitchell Whitelaw --- cybercultuur --- cyberspace --- wetenschap --- kunst en wetenschap --- technologie --- kunst en technologie --- artificiële intelligentie --- artificieel leven --- filosofie --- cultuurfilosofie --- a-life --- virtual reality --- virtuele realiteit --- 791.5 --- 130.2 --- 7.01 --- 82:7 Literatuur en kunst --- Literatuur en kunst --- Arts [Modern ] --- 20th century
Choose an application
The second edition of this successful textbook continues to provide a clear introduction to formal reasoning relevant to the needs of modern computer science and sufficiently exacting for practical applications. Improvements have been made throughout with many new and expanded text sections. The coverage of model-checking has been substantially updated and additional exercises are included. Internet support includes worked solutions for teacher exercises and model solutions to some student exercises. First Edition Hb (2000): 0-521-65200-6 First Edition Pb (2000): 0-521-65602-8
Computer logic --- Logic programming (Computer science) --- Computer logic. --- Logic programming. --- Logic programming (Computer science). --- Logique informatique --- 681.3*F11 <043> --- Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41}--Dissertaties --- 681.3*F11 <043> Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41}--Dissertaties --- 681.3*F41 Mathematical logic: computability theory computational logic lambda calculus logic programming mechanical theorem proving model theory proof theoryrecursive function theory--See also {681.3*F11} {681.3*I22} {681.3*I23} --- Mathematical logic: computability theory computational logic lambda calculus logic programming mechanical theorem proving model theory proof theoryrecursive function theory--See also {681.3*F11} {681.3*I22} {681.3*I23} --- 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} --- Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41} --- computermodel --- 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} --- 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*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Logic programming --- 681.3*F11 <043> Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}--Dissertaties --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}--Dissertaties --- Computer programming --- Computer science logic --- Logic, Symbolic and mathematical --- 681.3*F11 --- 681.3*F41 --- computerarchitectuur --- kunstmatige intelligentie (artificiële intelligentie) --- Computer science --- Mathematical logic --- Computer programs --- Logiciels --- Verification --- Vérification --- Informatique --- Logique mathématique --- Logique mathématique --- Vérification
Listing 1 - 3 of 3 |
Sort by
|