Turing-100. The Alan Turing Centenary32 articles•429 pages•Published: June 22, 2012 PapersPages 1-15 | Pages 16-19 | Pages 20-33 | Pages 34-41 | Pages 42-52 | Pages 53-65 | Pages 66-91 | Pages 92-97 | Pages 98-112 | Pages 113-117 | Pages 118-131 | Pages 132-139 | Pages 140-156 | Pages 157-167 | Pages 168-180 | Pages 181-195 | Pages 196-203 | Pages 204-213 | Pages 214-228 | Pages 229-238 | Pages 239-251 | Pages 252-267 | Pages 268-277 | Pages 278-288 | Pages 289-306 | Pages 307-325 | Pages 326-352 | Pages 353-369 | Pages 370-385 | Pages 386-404 | Pages 405-414 | Pages 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 |
|