| " |
| "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 |
