Turing machine representation in temporal concept analysis

  • Authors:
  • Karl Erich Wolff;Wendsomde Yameogo

  • Affiliations:
  • Mathematics and Science Faculty, Darmstadt University of Applied Sciences, Darmstadt, Germany;Independent Researcher

  • Venue:
  • ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.