EasyChair Proceedings in Computing
Turing-100 Volume Information
Volume:Andrei Voronkov (editor)
Turing-100. The Alan Turing Centenary

Turing-100 Volume Information

Title:Turing-100. The Alan Turing Centenary
Editors:Andrei Voronkov
Series:EasyChair Proceedings in Computing
Publication date:June 22, 2012


Claudio Angione, Giovanni Carapezza, Jole Costanza, Pietro Lio` and Giuseppe NicosiaComputing with Metabolic Machines1-15
Joscha Bach and Mario VerdicchioWhat kind of machine is the mind?16-19
Israel BelferThe Info-Computation Turn in Physics20-33
Fouad ChedidOn Natural Representations of Objects34-41
Edgar DaylightTuring's Influence on Programming42-52
Martin Escardo and Paulo OlivaComputing Nash Equilibria of Unbounded Games53-65
Michael FiskeTuring Incomputable Computation66-91
Jeroen FokkerThe chess example in Turing's Mind paper is really about ambiguity92-97
Rusins FreivaldsUltrametric automata and Turing machines98-112
Anthony J. Genot, Teruo Fujii and Yannick RondelezMolecular computations with competitive neural networks that exploit linear and nonlinear kinetics113-117
Laszlo Gyongyosi and Sandor ImreSecure Communication over Zero-Private Capacity Quantum Channels118-131
Laszlo Gyongyosi and Sandor ImreOn the Mathematical Boundaries of Communication with Zero-Capacity Quantum Channels132-139
Jose Hernandez-Orallo, Javier Insa, David Dowe and Bill HibbardTuring Tests with Turing Machines140-156
Tsan-Sheng Hsu, Churn-Jung Liau and Da-Wei WangLogic, Probability, and Privacy: A Framework for Specifying Privacy Requirements157-167
Cornelis Huizing, Ruurd Kuiper and Tom VerhoeffGeneralizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms168-180
Hadi Katebi, Karem A. Sakallah and Igor L. MarkovGraph Symmetry Detection and Canonical Labeling: Differences and Synergies181-195
Jozef KelemenA Note on Turing’s Three Pioneering Initiatives and on Their Interplays196-203
Daniel LeivantAlternating Turing machines and the analytical hierarchy204-213
Jerome LerouxVector Addition Systems Reachability Problem (A Simpler Solution)214-228
Shaoying LiuUtilizing Hoare Logic to Strengthen Testing for Error Detection in Programs229-238
Rao Mikkilineni, Albert Comparini and Giovanni MoranaThe Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing239-251
Cristian PrisacariuThe Glory of the Past and Geometrical Concurrency252-267
Frederic ProstOn the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess268-277
Yun Shang, Xian Lu and Ruqian LuThe computing power of Turing machine based on quantum logic278-288
Qiang Shen, Ren Diao and Pan SuFeature Selection Ensemble289-306
Mikhail Soutchanski and Wael YehiaTowards an Expressive Practical Logical Action Theory307-325
Sorin StratulatA Unified View of Induction Reasoning for First-Order Logic326-352
Omri TalTowards an Information-Theoretic Approach to Population Structure353-369
Tony VealeThe Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms370-385
Irina Virbitskaite, Nataliya Gribovskaya and Eike BestUnifying Equivalences for Timed Transition Systems386-404
Peter Wegner, Eugene Eberbach and Mark BurginComputational Completeness of Interaction Machines and Turing Machines405-414
Graham WhiteThe Frame Problem and the Semantics of Classical Proofs415-429


6turing machine
3turing test
2computability, expressiveness
1"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, 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, 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, vas, web