EasyChair Publications
Search
Turing-100 Keyphrase Index
Volume:Andrei Voronkov (editor)
Turing-100. The Alan Turing Centenary
KeyphrasePapers
"
"during" modalityThe Glory of the Past and Geometrical Concurrency
A
active elementTuring Incomputable Computation
alternating turing machinesAlternating Turing machines and the analytical hierarchy
ambiguityThe chess example in Turing's Mind paper is really about ambiguity
artificial intelligenceA Note on Turing’s Three Pioneering Initiatives and on Their Interplays
autonomic computingThe Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing
B
backward inductionComputing Nash Equilibria of Unbounded Games
bar recursionComputing Nash Equilibria of Unbounded Games
behavioral equivalencesUnifying Equivalences for Timed Transition Systems
biological cadComputing with Metabolic Machines
black hole thermodynamicsThe Info-Computation Turn in Physics
boolean functionTuring Incomputable Computation
C
category theoryThe Frame Problem and the Semantics of Classical Proofs
chess problemThe chess example in Turing's Mind paper is really about ambiguity
church tuirng hypothesisA Note on Turing’s Three Pioneering Initiatives and on Their Interplays
classical logicThe Frame Problem and the Semantics of Classical Proofs
classificationTowards an Information-Theoretic Approach to Population Structure
clichéThe Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
coalgebraic bisimulationUnifying Equivalences for Timed Transition Systems
completenessComputational Completeness of Interaction Machines and Turing Machines
computabilityWhat kind of machine is the mind?
A Note on Turing’s Three Pioneering Initiatives and on Their Interplays
computationComputational Completeness of Interaction Machines and Turing Machines
computationalismWhat kind of machine is the mind?
computer chessOn the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess
computer science historyOn the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess
concurrency modelsThe Glory of the Past and Geometrical Concurrency
cryptographySecure Communication over Zero-Private Capacity Quantum Channels
D
data privacyLogic, Probability, and Privacy: A Framework for Specifying Privacy Requirements
data reliabilityFeature Selection Ensemble
davisTuring's Influence on Programming
description logicTowards an Expressive Practical Logical Action Theory
digital ontologyThe Info-Computation Turn in Physics
digital physicsThe Info-Computation Turn in Physics
dime network architectureThe Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing
distributed computingThe Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing
dna nanotechnologyMolecular computations with competitive neural networks that exploit linear and nonlinear kinetics
E
ensembleFeature Selection Ensemble
ensemble constructionFeature Selection Ensemble
enzymesMolecular computations with competitive neural networks that exploit linear and nonlinear kinetics
execution based computation formalismsGeneralizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms
expedite the canonical labeling searchGraph Symmetry Detection and Canonical Labeling: Differences and Synergies
explicit inductionA Unified View of Induction Reasoning for First-Order Logic
expressivenessThe Glory of the Past and Geometrical Concurrency
Computational Completeness of Interaction Machines and Turing Machines
F
fcapsThe Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing
feature selectionFeature Selection Ensemble
firing patternTuring Incomputable Computation
frame problemThe Frame Problem and the Semantics of Classical Proofs
functionalismWhat kind of machine is the mind?
G
game theoryTuring Tests with Turing Machines
generalized rice theoremGeneralizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms
graph canonical labelingGraph Symmetry Detection and Canonical Labeling: Differences and Synergies
graph symmetry detectionGraph Symmetry Detection and Canonical Labeling: Differences and Synergies
H
halting theoremGeneralizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms
harmony searchFeature Selection Ensemble
hereditary history preserving bisimulationThe Glory of the Past and Geometrical Concurrency
higher dimensional automataThe Glory of the Past and Geometrical Concurrency
higher dimensional modal logicThe Glory of the Past and Geometrical Concurrency
historyTuring's Influence on Programming
history of scienceThe Info-Computation Turn in Physics
hoare logicUtilizing Hoare Logic to Strengthen Testing for Error Detection in Programs
human unpredictabilityTuring Tests with Turing Machines
hybrid logicLogic, Probability, and Privacy: A Framework for Specifying Privacy Requirements
hyperarithmetical setsAlternating Turing machines and the analytical hierarchy
hypercomputationTuring Incomputable Computation
I
imitation gamesTuring Tests with Turing Machines
implicit inductionA Unified View of Induction Reasoning for First-Order Logic
incomputableTuring Incomputable Computation
induction theorem provingA Unified View of Induction Reasoning for First-Order Logic
information systemsLogic, Probability, and Privacy: A Framework for Specifying Privacy Requirements
information theoryTowards an Information-Theoretic Approach to Population Structure
informativeness for assignmentTowards an Information-Theoretic Approach to Population Structure
intelligenceTuring Tests with Turing Machines
interaction machineComputational Completeness of Interaction Machines and Turing Machines
K
kolmogorov complexityOn Natural Representations of Objects
L
languageThe Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
learningTuring Tests with Turing Machines
level setTuring Incomputable Computation
linguistic creativityThe Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
linguistic normsThe Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
linguisticsThe Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
logicTuring's Influence on Programming
logics for reasoning about actionsTowards an Expressive Practical Logical Action Theory
M
matching penniesTuring Tests with Turing Machines
meaningful informationOn Natural Representations of Objects
metabolic machineComputing with Metabolic Machines
mind as machineWhat kind of machine is the mind?
modal logicThe Frame Problem and the Semantics of Classical Proofs
models of computationUltrametric automata and Turing machines
morphogenesisA Note on Turing’s Three Pioneering Initiatives and on Their Interplays
N
nash equilibriumComputing Nash Equilibria of Unbounded Games
natural computingA Note on Turing’s Three Pioneering Initiatives and on Their Interplays
natural representationOn Natural Representations of Objects
neural networksMolecular computations with competitive neural networks that exploit linear and nonlinear kinetics
nonlinear kineticsMolecular computations with competitive neural networks that exploit linear and nonlinear kinetics
O
open maps bisimulationUnifying Equivalences for Timed Transition Systems
oracle machineThe Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing
P
p adic numbersUltrametric automata and Turing machines
pan computationalismThe Info-Computation Turn in Physics
pareto optimalityComputing with Metabolic Machines
past modalitiesThe Glory of the Past and Geometrical Concurrency
path bisimulationUnifying Equivalences for Timed Transition Systems
petri netVector Addition Systems Reachability Problem (A Simpler Solution)
philosophy of aiWhat kind of machine is the mind?
philosophy of scienceThe Info-Computation Turn in Physics
polaractivationSecure Communication over Zero-Private Capacity Quantum Channels
population divergenceTowards an Information-Theoretic Approach to Population Structure
positive and negative randomnessOn Natural Representations of Objects
presburger arithmeticVector Addition Systems Reachability Problem (A Simpler Solution)
private quantum communicationSecure Communication over Zero-Private Capacity Quantum Channels
probabilistic algorithmsUltrametric automata and Turing machines
probabilistic logicLogic, Probability, and Privacy: A Framework for Specifying Privacy Requirements
program analysisUtilizing Hoare Logic to Strengthen Testing for Error Detection in Programs
programmingTuring's Influence on Programming
progressionTowards an Expressive Practical Logical Action Theory
proof theoryThe Frame Problem and the Semantics of Classical Proofs
Q
quantum communicationsOn the Mathematical Boundaries of Communication with Zero-Capacity Quantum Channels
quantum cryptographySecure Communication over Zero-Private Capacity Quantum Channels
quantum entanglementOn the Mathematical Boundaries of Communication with Zero-Capacity Quantum Channels
quantum informationOn the Mathematical Boundaries of Communication with Zero-Capacity Quantum Channels
quantum logicThe computing power of Turing machine based on quantum logic
quantum randomTuring Incomputable Computation
R
reachability problemVector Addition Systems Reachability Problem (A Simpler Solution)
regressionTowards an Expressive Practical Logical Action Theory
reiter s basic action theoriesTowards an Expressive Practical Logical Action Theory
S
scientific revolutionThe Info-Computation Turn in Physics
selection functionsComputing Nash Equilibria of Unbounded Games
sensitive and fragile biological circuitsComputing with Metabolic Machines
sensitivity and robustness analysisComputing with Metabolic Machines
situation calculusTowards an Expressive Practical Logical Action Theory
social impact of information technologyOn the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess
software testingUtilizing Hoare Logic to Strengthen Testing for Error Detection in Programs
solomonoff kolmogorov complexityTuring Tests with Turing Machines
specification based computation formalismsGeneralizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms
specification based testingUtilizing Hoare Logic to Strengthen Testing for Error Detection in Programs
st configuration structuresThe Glory of the Past and Geometrical Concurrency
stereotypesThe Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
styles of reasoningThe Info-Computation Turn in Physics
subgame optimal equilibriumComputing Nash Equilibria of Unbounded Games
super turing computational powerThe computing power of Turing machine based on quantum logic
T
the analytical hierarchyAlternating Turing machines and the analytical hierarchy
the projection problemTowards an Expressive Practical Logical Action Theory
timeTuring Incomputable Computation
timed transition systemUnifying Equivalences for Timed Transition Systems
turingTuring's Influence on Programming
turing machineTuring Incomputable Computation
Turing Tests with Turing Machines
A Note on Turing’s Three Pioneering Initiatives and on Their Interplays
The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing
The computing power of Turing machine based on quantum logic
Computational Completeness of Interaction Machines and Turing Machines
turing testThe chess example in Turing's Mind paper is really about ambiguity
Turing Tests with Turing Machines
A Note on Turing’s Three Pioneering Initiatives and on Their Interplays
V
vasVector Addition Systems Reachability Problem (A Simpler Solution)
W
webThe Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms