Turing-100: Volume InformationTuring-100. The Alan Turing Centenary32 articles•429 pages•Published: June 22, 2012 PapersClaudio Angione, Giovanni Carapezza, Jole Costanza, Pietro Lio and Giuseppe Nicosia 1-15 | Joscha Bach and Mario Verdicchio 16-19 | Israel Belfer 20-33 | Fouad Chedid 34-41 | Edgar G. Daylight 42-52 | Martin Escardo and Paulo Oliva 53-65 | Michael Stephen Fiske 66-91 | Jeroen Fokker 92-97 | Rusins Freivalds 98-112 | Anthony J. Genot, Teruo Fujii and Yannick Rondelez 113-117 | Laszlo Gyongyosi and Sandor Imre 118-131 | Laszlo Gyongyosi and Sandor Imre 132-139 | Jose Hernandez-Orallo, Javier Insa, David Dowe and Bill Hibbard 140-156 | Tsan-Sheng Hsu, Churn-Jung Liau and Da-Wei Wang 157-167 | Cornelis Huizing, Ruurd Kuiper and Tom Verhoeff 168-180 | Hadi Katebi, Karem A. Sakallah and Igor L. Markov 181-195 | Jozef Kelemen 196-203 | Daniel Leivant 204-213 | Jerome Leroux 214-228 | Shaoying Liu 229-238 | Rao Mikkilineni, Albert Comparini and Giovanni Morana 239-251 | Cristian Prisacariu 252-267 | Frederic Prost 268-277 | Yun Shang, Xian Lu and Ruqian Lu 278-288 | Qiang Shen, Ren Diao and Pan Su 289-306 | Mikhail Soutchanski and Wael Yehia 307-325 | Sorin Stratulat 326-352 | Omri Tal 353-369 | Tony Veale 370-385 | Irina Virbitskaite, Natalya Gribovskaya and Eike Best 386-404 | Peter Wegner, Eugene Eberbach and Mark Burgin 405-414 | Graham White 415-429 |
Keyphrases"during" modality, active element, alternating Turing machines, ambiguity, Artificial Intelligence, Autonomic Computing, backward induction, bar recursion, behavioral equivalences, Biological CAD, black-hole thermodynamics, Boolean function, category theory, chess problem, Church-Tuirng Hypothesis, classical logic, Classification, cliché, Coalgebraic Bisimulation, completeness, computability2, computation, Computationalism, computer chess, computer science history, concurrency models, Cryptography, data privacy, Data Reliability, Davis, Description Logic, digital ontology, Digital physics, DIME Network Architecture, distributed computing, DNA nanotechnology, Ensemble, Ensemble Construction, enzymes, Execution-based computation formalisms, Expedite the Canonical Labeling Search, explicit induction, expressiveness2, FCAPS, feature selection, firing pattern, frame problem, functionalism, game theory, generalized Rice theorem, Graph Canonical Labeling, Graph Symmetry Detection, Halting Theorem, Harmony Search, hereditary history preserving bisimulation, higher dimensional automata, higher dimensional modal logic, history, history of science, Hoare logic, human unpredictability, hybrid logic, hyperarithmetical sets, hypercomputation, imitation games, implicit induction, incomputable, induction theorem proving, Information Systems, information theory, informativeness for assignment, intelligence, Interaction machine, Kolmogorov complexity, language, learning, level set, linguistic creativity, Linguistic norms, linguistics, logic, logics for reasoning about actions, matching pennies, meaningful information, metabolic machine, Mind as machine, modal logic, models of computation, morphogenesis, Nash equilibrium, natural computing, Natural representation, neural networks, nonlinear kinetics, Open Maps Bisimulation, oracle machine, p-adic numbers, Pan-computationalism, Pareto optimality, past modalities, Path Bisimulation, Petri net, Philosophy of AI, philosophy of science, polaractivation, population divergence, positive and negative randomness, Presburger arithmetic, private quantum communication, probabilistic algorithms, probabilistic logic, program analysis, programming, progression, proof theory, quantum communications, quantum cryptography, quantum entanglement, quantum information, quantum logic, quantum random, reachability problem, Regression, Reiter's Basic action theories, scientific revolution, selection functions, Sensitive and Fragile Biological Circuits, Sensitivity and Robustness Analysis, Situation Calculus, social impact of information technology, software testing, Solomonoff-Kolmogorov complexity, Specification-based computation formalisms, specification-based testing, ST-configuration structures, stereotypes, styles of reasoning, subgame optimal equilibrium, super-Turing computational power, the analytical hierarchy, the projection problem, time, timed transition system, Turing, Turing machine6, Turing Test3, VAS, Web. |
|