EasyChair Publications
Search
Home
EPiC Series
Kalpa Publications
For Authors
For Editors
Volume
•
Abstracts
•
Preface
•
Author Index
•
Keyphrase Index
•
Bibtex Entries
Turing-100 Keyphrase Index
Volume:
Andrei Voronkov
(editor)
Turing-100. The Alan Turing Centenary
Keyphrase
Papers
"
"during" modality
The Glory of the Past and Geometrical Concurrency
A
active element
Turing Incomputable Computation
alternating turing machines
Alternating Turing machines and the analytical hierarchy
ambiguity
The chess example in Turing's Mind paper is really about ambiguity
artificial intelligence
A Note on Turing’s Three Pioneering Initiatives and on Their Interplays
autonomic computing
The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing
B
backward induction
Computing Nash Equilibria of Unbounded Games
bar recursion
Computing Nash Equilibria of Unbounded Games
behavioral equivalences
Unifying Equivalences for Timed Transition Systems
biological cad
Computing with Metabolic Machines
black hole thermodynamics
The Info-Computation Turn in Physics
boolean function
Turing Incomputable Computation
C
category theory
The Frame Problem and the Semantics of Classical Proofs
chess problem
The chess example in Turing's Mind paper is really about ambiguity
church tuirng hypothesis
A Note on Turing’s Three Pioneering Initiatives and on Their Interplays
classical logic
The Frame Problem and the Semantics of Classical Proofs
classification
Towards 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 bisimulation
Unifying Equivalences for Timed Transition Systems
completeness
Computational Completeness of Interaction Machines and Turing Machines
computability
What kind of machine is the mind?
A Note on Turing’s Three Pioneering Initiatives and on Their Interplays
computation
Computational Completeness of Interaction Machines and Turing Machines
computationalism
What kind of machine is the mind?
computer chess
On the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess
computer science history
On the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess
concurrency models
The Glory of the Past and Geometrical Concurrency
cryptography
Secure Communication over Zero-Private Capacity Quantum Channels
D
data privacy
Logic, Probability, and Privacy: A Framework for Specifying Privacy Requirements
data reliability
Feature Selection Ensemble
davis
Turing's Influence on Programming
description logic
Towards an Expressive Practical Logical Action Theory
digital ontology
The Info-Computation Turn in Physics
digital physics
The Info-Computation Turn in Physics
dime network architecture
The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing
distributed computing
The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing
dna nanotechnology
Molecular computations with competitive neural networks that exploit linear and nonlinear kinetics
E
ensemble
Feature Selection Ensemble
ensemble construction
Feature Selection Ensemble
enzymes
Molecular computations with competitive neural networks that exploit linear and nonlinear kinetics
execution based computation formalisms
Generalizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms
expedite the canonical labeling search
Graph Symmetry Detection and Canonical Labeling: Differences and Synergies
explicit induction
A Unified View of Induction Reasoning for First-Order Logic
expressiveness
The Glory of the Past and Geometrical Concurrency
Computational Completeness of Interaction Machines and Turing Machines
F
fcaps
The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing
feature selection
Feature Selection Ensemble
firing pattern
Turing Incomputable Computation
frame problem
The Frame Problem and the Semantics of Classical Proofs
functionalism
What kind of machine is the mind?
G
game theory
Turing Tests with Turing Machines
generalized rice theorem
Generalizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms
graph canonical labeling
Graph Symmetry Detection and Canonical Labeling: Differences and Synergies
graph symmetry detection
Graph Symmetry Detection and Canonical Labeling: Differences and Synergies
H
halting theorem
Generalizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms
harmony search
Feature Selection Ensemble
hereditary history preserving bisimulation
The Glory of the Past and Geometrical Concurrency
higher dimensional automata
The Glory of the Past and Geometrical Concurrency
higher dimensional modal logic
The Glory of the Past and Geometrical Concurrency
history
Turing's Influence on Programming
history of science
The Info-Computation Turn in Physics
hoare logic
Utilizing Hoare Logic to Strengthen Testing for Error Detection in Programs
human unpredictability
Turing Tests with Turing Machines
hybrid logic
Logic, Probability, and Privacy: A Framework for Specifying Privacy Requirements
hyperarithmetical sets
Alternating Turing machines and the analytical hierarchy
hypercomputation
Turing Incomputable Computation
I
imitation games
Turing Tests with Turing Machines
implicit induction
A Unified View of Induction Reasoning for First-Order Logic
incomputable
Turing Incomputable Computation
induction theorem proving
A Unified View of Induction Reasoning for First-Order Logic
information systems
Logic, Probability, and Privacy: A Framework for Specifying Privacy Requirements
information theory
Towards an Information-Theoretic Approach to Population Structure
informativeness for assignment
Towards an Information-Theoretic Approach to Population Structure
intelligence
Turing Tests with Turing Machines
interaction machine
Computational Completeness of Interaction Machines and Turing Machines
K
kolmogorov complexity
On Natural Representations of Objects
L
language
The Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
learning
Turing Tests with Turing Machines
level set
Turing Incomputable Computation
linguistic creativity
The Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
linguistic norms
The Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
linguistics
The Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
logic
Turing's Influence on Programming
logics for reasoning about actions
Towards an Expressive Practical Logical Action Theory
M
matching pennies
Turing Tests with Turing Machines
meaningful information
On Natural Representations of Objects
metabolic machine
Computing with Metabolic Machines
mind as machine
What kind of machine is the mind?
modal logic
The Frame Problem and the Semantics of Classical Proofs
models of computation
Ultrametric automata and Turing machines
morphogenesis
A Note on Turing’s Three Pioneering Initiatives and on Their Interplays
N
nash equilibrium
Computing Nash Equilibria of Unbounded Games
natural computing
A Note on Turing’s Three Pioneering Initiatives and on Their Interplays
natural representation
On Natural Representations of Objects
neural networks
Molecular computations with competitive neural networks that exploit linear and nonlinear kinetics
nonlinear kinetics
Molecular computations with competitive neural networks that exploit linear and nonlinear kinetics
O
open maps bisimulation
Unifying Equivalences for Timed Transition Systems
oracle machine
The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing
P
p adic numbers
Ultrametric automata and Turing machines
pan computationalism
The Info-Computation Turn in Physics
pareto optimality
Computing with Metabolic Machines
past modalities
The Glory of the Past and Geometrical Concurrency
path bisimulation
Unifying Equivalences for Timed Transition Systems
petri net
Vector Addition Systems Reachability Problem (A Simpler Solution)
philosophy of ai
What kind of machine is the mind?
philosophy of science
The Info-Computation Turn in Physics
polaractivation
Secure Communication over Zero-Private Capacity Quantum Channels
population divergence
Towards an Information-Theoretic Approach to Population Structure
positive and negative randomness
On Natural Representations of Objects
presburger arithmetic
Vector Addition Systems Reachability Problem (A Simpler Solution)
private quantum communication
Secure Communication over Zero-Private Capacity Quantum Channels
probabilistic algorithms
Ultrametric automata and Turing machines
probabilistic logic
Logic, Probability, and Privacy: A Framework for Specifying Privacy Requirements
program analysis
Utilizing Hoare Logic to Strengthen Testing for Error Detection in Programs
programming
Turing's Influence on Programming
progression
Towards an Expressive Practical Logical Action Theory
proof theory
The Frame Problem and the Semantics of Classical Proofs
Q
quantum communications
On the Mathematical Boundaries of Communication with Zero-Capacity Quantum Channels
quantum cryptography
Secure Communication over Zero-Private Capacity Quantum Channels
quantum entanglement
On the Mathematical Boundaries of Communication with Zero-Capacity Quantum Channels
quantum information
On the Mathematical Boundaries of Communication with Zero-Capacity Quantum Channels
quantum logic
The computing power of Turing machine based on quantum logic
quantum random
Turing Incomputable Computation
R
reachability problem
Vector Addition Systems Reachability Problem (A Simpler Solution)
regression
Towards an Expressive Practical Logical Action Theory
reiter s basic action theories
Towards an Expressive Practical Logical Action Theory
S
scientific revolution
The Info-Computation Turn in Physics
selection functions
Computing Nash Equilibria of Unbounded Games
sensitive and fragile biological circuits
Computing with Metabolic Machines
sensitivity and robustness analysis
Computing with Metabolic Machines
situation calculus
Towards an Expressive Practical Logical Action Theory
social impact of information technology
On the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess
software testing
Utilizing Hoare Logic to Strengthen Testing for Error Detection in Programs
solomonoff kolmogorov complexity
Turing Tests with Turing Machines
specification based computation formalisms
Generalizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms
specification based testing
Utilizing Hoare Logic to Strengthen Testing for Error Detection in Programs
st configuration structures
The Glory of the Past and Geometrical Concurrency
stereotypes
The Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
styles of reasoning
The Info-Computation Turn in Physics
subgame optimal equilibrium
Computing Nash Equilibria of Unbounded Games
super turing computational power
The computing power of Turing machine based on quantum logic
T
the analytical hierarchy
Alternating Turing machines and the analytical hierarchy
the projection problem
Towards an Expressive Practical Logical Action Theory
time
Turing Incomputable Computation
timed transition system
Unifying Equivalences for Timed Transition Systems
turing
Turing's Influence on Programming
turing machine
Turing 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 test
The 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
vas
Vector Addition Systems Reachability Problem (A Simpler Solution)
W
web
The Soul of a New Cliché: Conventions and Meta-Conventions in the Creative Linguistic Variation of Familiar Forms
Copyright © 2012-2017 easychair.org. All rights reserved.