Turing-100: Author Index| Author | Papers | 
|---|
 | A |  | Angione, Claudio | Computing with Metabolic Machines |  | B |  | Bach, Joscha | What kind of machine is the mind? |  | Belfer, Israel | The Info-Computation Turn in Physics |  | Best, Eike | Unifying Equivalences for Timed Transition Systems |  | Burgin, Mark | Computational Completeness of Interaction Machines and Turing Machines |  | C |  | Carapezza, Giovanni | Computing with Metabolic Machines |  | Chedid, Fouad | On Natural Representations of Objects |  | Comparini, Albert | The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing |  | Costanza, Jole | Computing with Metabolic Machines |  | D |  | Daylight, Edgar | Turing's Influence on Programming |  | Diao, Ren | Feature Selection Ensemble |  | Dowe, David | Turing Tests with Turing Machines |  | E |  | Eberbach, Eugene | Computational Completeness of Interaction Machines and Turing Machines |  | Escardo, Martin | Computing Nash Equilibria of Unbounded Games |  | F |  | Fiske, Michael | Turing Incomputable Computation |  | Fokker, Jeroen | The chess example in Turing's Mind paper is really about ambiguity |  | Freivalds, Rusins | Ultrametric  automata and Turing machines |  | Fujii, Teruo | Molecular computations with competitive neural networks that exploit linear and nonlinear kinetics |  | G |  | Genot, Anthony J. | Molecular computations with competitive neural networks that exploit linear and nonlinear kinetics |  | Gribovskaya, Nataliya | Unifying Equivalences for Timed Transition Systems |  | Gyongyosi, Laszlo | Secure Communication over Zero-Private Capacity Quantum Channels On the Mathematical Boundaries of Communication with Zero-Capacity Quantum Channels |  | H |  | Hernandez-Orallo, Jose | Turing Tests with Turing Machines |  | Hibbard, Bill | Turing Tests with Turing Machines |  | Hsu, Tsan-Sheng | Logic, Probability, and Privacy: A Framework for Specifying Privacy Requirements |  | Huizing, Cornelis | Generalizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms |  | I |  | Imre, Sandor | Secure Communication over Zero-Private Capacity Quantum Channels |  | Imre, Sandor | On the Mathematical Boundaries of Communication with Zero-Capacity Quantum Channels |  | Insa, Javier | Turing Tests with Turing Machines |  | K |  | Katebi, Hadi | Graph Symmetry Detection and Canonical Labeling: Differences and Synergies |  | Kelemen, Jozef | A Note on Turing’s Three Pioneering Initiatives and on Their Interplays |  | Kuiper, Ruurd | Generalizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms |  | L |  | Leivant, Daniel | Alternating Turing machines and the analytical hierarchy |  | Leroux, Jerome | Vector Addition Systems Reachability Problem (A Simpler Solution) |  | Liau, Churn-Jung | Logic, Probability, and Privacy: A Framework for Specifying Privacy Requirements |  | Lio`, Pietro | Computing with Metabolic Machines |  | Liu, Shaoying | Utilizing Hoare Logic to Strengthen Testing for Error Detection in Programs |  | Lu, Ruqian | The computing power of Turing machine based on quantum logic |  | Lu, Xian | The computing power of Turing machine based on quantum logic |  | M |  | Markov, Igor L. | Graph Symmetry Detection and Canonical Labeling: Differences and Synergies |  | Mikkilineni, Rao | The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing |  | Morana, Giovanni | The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing |  | N |  | Nicosia, Giuseppe | Computing with Metabolic Machines |  | O |  | Oliva, Paulo | Computing Nash Equilibria of Unbounded Games |  | P |  | Prisacariu, Cristian | The Glory of the Past and Geometrical Concurrency |  | Prost, Frederic | On the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess |  | R |  | Rondelez, Yannick | Molecular computations with competitive neural networks that exploit linear and nonlinear kinetics |  | S |  | Sakallah, Karem A. | Graph Symmetry Detection and Canonical Labeling: Differences and Synergies |  | Shang, Yun | The computing power of Turing machine based on quantum logic |  | Shen, Qiang | Feature Selection Ensemble |  | Soutchanski, Mikhail | Towards an Expressive Practical Logical Action Theory |  | Stratulat, Sorin | A Unified View of Induction Reasoning for First-Order Logic |  | Su, Pan | Feature Selection Ensemble |  | T |  | Tal, Omri | Towards an Information-Theoretic Approach to Population Structure |  | V |  | Veale, Tony | The Soul of a New Cliché: Conventions and Meta-Conventions in  the Creative Linguistic Variation of Familiar Forms  |  | Verdicchio, Mario | What kind of machine is the mind? |  | Verhoeff, Tom | Generalizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms |  | Virbitskaite, Irina | Unifying Equivalences for Timed Transition Systems |  | W |  | Wang, Da-Wei | Logic, Probability, and Privacy: A Framework for Specifying Privacy Requirements |  | Wegner, Peter | Computational Completeness of Interaction Machines and Turing Machines |  | White, Graham | The Frame Problem and the Semantics of Classical Proofs |  | Y |  | Yehia, Wael | Towards an Expressive Practical Logical Action Theory |  
  |  
  |