Skip to main content

Turing Machine Representation in Temporal Concept Analysis

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3403))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arbib, M.A.: Theory of Abstract Automata. Prentice Hall, Englewood Cliffs (1970)

    Google Scholar 

  2. Bertalanffy, L.v.: General System Theory. George Braziller, New York (1969)

    Google Scholar 

  3. Birkhoff, G.: Lattice theory, 3rd edn. Amer. Math. Soc., Providence (1967)

    MATH  Google Scholar 

  4. Butterfield, J. (ed.): The Arguments of Time. Oxford University Press, Oxford (1999)

    Google Scholar 

  5. Butterfield, J., Isham, C.J.: On the Emergence of Time in Quantum Gravity. In: Butterfield, J. (ed.) The Arguments of Time. Oxford University Press, Oxford (1999)

    Google Scholar 

  6. Castellani, E. (ed.): Interpreting Bodies: Classical and Quantum Objects in Modern Physics. Princeton University Press, Princeton (1998)

    Google Scholar 

  7. Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, London (1974)

    MATH  Google Scholar 

  8. Gabbay, D.M., Hodkinson, I., Reynolds, M.: Temporal Logic - Mathematical Foundations and Computational Aspects, vol. 1. Clarendon Press, Oxford (1994)

    Google Scholar 

  9. Ganter, B., Wille, R.: Formal Concept Analysis: mathematical foundations (translated from the German by Cornelia Franzke). Springer, Heidelberg (1999)

    Google Scholar 

  10. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  11. Loeckx, J.: Algorithmentheorie. Springer, Heidelberg (1976)

    MATH  Google Scholar 

  12. Malcev, A.I.: Algorithmen und rekursive Funktionen. Vieweg-Verlag, Braunschweig (1974)

    MATH  Google Scholar 

  13. Post, E.L.: Finite combinatory processes - Formulation. J. Symbolic Logic 1, 103–105 (1936)

    Article  MATH  Google Scholar 

  14. Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. In: Proc. London Math. Soc., vol. 2(42), pp. 230–265 (1936); A correction, ibid. 43, 544–546 (1936)

    Google Scholar 

  15. Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem, http://www.abelard.org/turpap2/tp2-ie.asp#section-9

  16. van Benthem, J.: Temporal Logic. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, Epistemic and Temporal Reasoning, vol. 4, pp. 241–350. Clarendon Press, Oxford (1995)

    Google Scholar 

  17. Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Reidel, Dordrecht (1982)

    Google Scholar 

  18. Wille, R.: Introduction to Formal Concept Analysis. In: Negrini, G. (ed.): Modelli e modellizzazione. Models and modelling. Consiglio Nazionale delle Ricerche, Istituto di Studi sulla Ricerca e Documentatione Scientifica, Roma, pp. 39–51 (1997)

    Google Scholar 

  19. Wille, R.: Conceptual graphs and Formal Concept Analysis. In: Delugach, H.S., Keeler, M.A., Searle, L., Lukose, D., Sowa, J.F. (eds.) ICCS 1997. LNCS (LNAI), vol. 1257, pp. 290–303. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  20. Wolff, K.E.: A first course in Formal Concept Analysis - How to understand line diagrams. In: Faulbaum, F. (ed.) SoftStat 1993, Advances in Statistical Software, vol. 4, pp. 429–438. Gustav Fischer Verlag, Stuttgart (1994)

    Google Scholar 

  21. Wolff, K.E.: Concepts, States, and Systems. In: Dubois, D.M. (ed.) Computing Anticipatory Systems. CASYS 1999 - Third International Conference, Liège, Belgium (1999); American Institute of Physics, Conference Proceedings 517, pp. 83–97 (2000)

    Google Scholar 

  22. Wolff, K.E.: Towards a Conceptual System Theory. In: Sanchez, B., Nada, N., Rashid, A., Arndt, T., Sanchez, M. (eds.) Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, SCI 2000. Information Systems Development, International Institute of Informatics and Systemics, vol. II, pp. 124–132 (2000)

    Google Scholar 

  23. Wolff, K.E.: A Conceptual View of Knowledge Bases in Rough Set Theory. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 220–228. Springer, Heidelberg (2001); Revised Papers 2000

    Chapter  Google Scholar 

  24. Wolff, K.E.: Temporal Concept Analysis. In: Mephu Nguifo, E., et al. (eds.) ICCS 2001 International Workshop on Concept Lattices-Based Theory, Methods and Tools for Knowledge Discovery in Databases, pp. 91–107. Stanford University, Palo Alto (2001)

    Google Scholar 

  25. Wolff, K.E.: Transitions in Conceptual Time Systems. In: Dubois, D.M. (ed.) International Journal of Computing Anticipatory Systems, CHAOS 2002, vol. 11, pp. 398–412 (2002)

    Google Scholar 

  26. Wolff, K.E.: Interpretation of Automata in Temporal Concept Analysis. In: Priss, U., Corbett, D.R., Angelova, G. (eds.) ICCS 2002. LNCS (LNAI), vol. 2393, pp. 341–353. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  27. Wolff, K.E., Yameogo, W.: Time Dimension, Objects, and Life Tracks - A Conceptual Analysis. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS (LNAI), vol. 2746, pp. 188–200. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  28. Wolff, K.E.: ‘Particles’ and ‘Waves’ as Understood by Temporal Concept Analysis. In: Wolff, K.E., Pfeiffer, H.D., Delugach, H.S. (eds.) ICCS 2004. LNCS (LNAI), vol. 3127, pp. 126–141. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  29. Yameogo, W.: Time Conceptual Foundations of Programming. Master Thesis. Department of Computer Science at Darmstadt University of Applied Sciences (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolff, K.E., Yameogo, W. (2005). Turing Machine Representation in Temporal Concept Analysis. In: Ganter, B., Godin, R. (eds) Formal Concept Analysis. ICFCA 2005. Lecture Notes in Computer Science(), vol 3403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32262-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32262-7_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24525-4

  • Online ISBN: 978-3-540-32262-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics