EasyChair logo

EPiC Volume 10

Andrei Voronkov (editor)

Turing-100. The Alan Turing Centenary

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 MachinesPDF
Joscha Bach and Mario VerdicchioWhat kind of machine is the mind?PDF
Israel BelferThe Info-Computation Turn in PhysicsPDF
Fouad ChedidOn Natural Representations of ObjectsPDF
Edgar G. DaylightTuring's Influence on ProgrammingPDF
Martin Escardo and Paulo OlivaComputing Nash Equilibria of Unbounded GamesPDF
Michael Stephen FiskeTuring Incomputable ComputationPDF
Jeroen FokkerThe chess example in Turing's Mind paper is really about ambiguityPDF
Rusins FreivaldsUltrametric automata and Turing machinesPDF
Anthony J. Genot, Teruo Fujii and Yannick RondelezMolecular computations with competitive neural networks that exploit linear and nonlinear kineticsPDF
Laszlo Gyongyosi and Sandor ImreSecure Communication over Zero-Private Capacity Quantum ChannelsPDF
Laszlo Gyongyosi and Sandor ImreOn the Mathematical Boundaries of Communication with Zero-Capacity Quantum ChannelsPDF
Jose Hernandez-Orallo, Javier Insa, David Dowe and Bill HibbardTuring Tests with Turing MachinesPDF
Tsan-Sheng Hsu, Churn-Jung Liau and Da-Wei WangLogic, Probability, and Privacy: A Framework for Specifying Privacy RequirementsPDF
Cornelis Huizing, Ruurd Kuiper and Tom VerhoeffGeneralizations of Rice's Theorem, Applicable to Executable and Non-Executable FormalismsPDF
Hadi Katebi, Karem A. Sakallah and Igor L. MarkovGraph Symmetry Detection and Canonical Labeling: Differences and SynergiesPDF
Jozef KelemenA Note on Turing’s Three Pioneering Initiatives and on Their InterplaysPDF
Daniel LeivantAlternating Turing machines and the analytical hierarchyPDF
Jerome LerouxVector Addition Systems Reachability Problem (A Simpler Solution)PDF
Shaoying LiuUtilizing Hoare Logic to Strengthen Testing for Error Detection in ProgramsPDF
Rao Mikkilineni, Albert Comparini and Giovanni MoranaThe Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed ComputingPDF
Cristian PrisacariuThe Glory of the Past and Geometrical ConcurrencyPDF
Frederic ProstOn the Impact of Information Technologies on Society: an Historical Perspective through the Game of ChessPDF
Yun Shang, Xian Lu and Ruqian LuThe computing power of Turing machine based on quantum logicPDF
Qiang Shen, Ren Diao and Pan SuFeature Selection EnsemblePDF
Mikhail Soutchanski and Wael YehiaTowards an Expressive Practical Logical Action TheoryPDF
Sorin StratulatA Unified View of Induction Reasoning for First-Order LogicPDF
Omri TalTowards an Information-Theoretic Approach to Population StructurePDF
Tony VealeThe Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar FormsPDF
Irina Virbitskaite, Natalya Gribovskaya and Eike BestUnifying Equivalences for Timed Transition SystemsPDF
Peter Wegner, Eugene Eberbach and Mark BurginComputational Completeness of Interaction Machines and Turing MachinesPDF
Graham WhiteThe Frame Problem and the Semantics of Classical ProofsPDF