Turing Machine Representation in Temporal Concept Analysis

The purpose of this paper is to investigate the connection between the theory of computation and Temporal Concept Analysis, the temporal branch of Formal Concept Analysis. The main idea is to represent for each possible input of a given algorithm the uniquely determined sequence of computation steps as a life track of an object in some conceptually described state space. For that purpose we introduce for a given Turing machine a Conceptual Time System with Actual Objects and a Time Relation (CTSOT) which yields the state automaton of a Turing machine as well as its configuration automaton. The conceptual role of the instructions of a Turing machine is understood as a set of background implications of the derived context of a Turing CTSOT.

[1]  Galia Angelova,et al.  Conceptual Structures: Integration and Interfaces , 2002, Lecture Notes in Computer Science.

[2]  Emil L. Post.  Finite combinatory processes—formulation , 1936, Journal of Symbolic Logic.

[3]  Karl Erich Wolff.  Concepts, states, and systems , 2001 .

[4]  Jeremy Butterfield.  The arguments of time , 2006 .

[5]  J. van Benthem,et al.  Temporal logic , 1995 .

[6]  Dov M. Gabbay,et al.  Handbook of logic in artificial intelligence and logic programming (Vol. 4): epistemic and temporal reasoning , 1995 .

[7]  J. Butterfield,et al.  On the Emergence of Time in Quantum Gravity , 1999 .

[8]  Rudolf Wille,et al.  Introduction to formal concept analysis , 1996 .

[9]  Sadaaki Miyamoto,et al.  Rough Sets and Current Trends in Computing , 2012, Lecture Notes in Computer Science.

[10]  Elena Castellani.  Interpreting bodies : classical and quantum objects in modern physics , 1998 .

[11]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[12]  Dov M. Gabbay,et al.  Temporal logic (vol. 1): mathematical foundations and computational aspects , 1994 .

[13]  Karl Erich Wolff,et al.  A Conceptual View of Knowledge Bases in Rough Set Theory , 2000, Rough Sets and Current Trends in Computing.

[14]  Rudolf Wille,et al.  Conceptual Graphs and Formal Concept Analysis , 1997, ICCS.

[15]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[16]  Karl Erich Wolff,et al.  'Particles' and 'Waves' as Understood by Temporal Concept Analysis , 2004, ICCS.

[17]  R. P. Dilworth.  Review: G. Birkhoff, Lattice theory , 1950 .

[18]  Karl Erich Wolff,et al.  Time Dimension, Objects, and Life Tracks. A Conceptual Analysis , 2003, ICCS.

[19]  Bernhard Ganter,et al.  Conceptual Structures for Knowledge Creation and Communication , 2003, Lecture Notes in Computer Science.

[20]  A. I. Malcev.  Algorithmen und rekursive Funktionen , 1974 .

[21]  Ludwig von Bertalanffy,et al.  General System Theory , 1969 .

[22]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[23]  Harry S. Delugach,et al.  Conceptual Structures at Work , 2004, Lecture Notes in Computer Science.

[24]  Karl Erich Wolff.  Interpretation of Automata in Temporal Concept Analysis , 2002, ICCS.

[25]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[26]  Daniel M. Dubois,et al.  Computing Anticipatory Systems , 1998 .

[27]  F. Faulbaum.  SoftStat '93: Advances in Statistical Software 4. , 1995 .

[28]  Dov M. Gabbay,et al.  Epistemic and temporal reasoning , 1995 .

[29]  John F. Sowa,et al.  Conceptual Structures: Fulfilling Peirce's Dream , 1997, Lecture Notes in Computer Science.

[30]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[31]  D. Gabbay,et al.  Temporal Logic Mathematical Foundations and Computational Aspects , 1994 .