Algorithms and Their Explanations

  • Marco Benini
  • Federico Gobbo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8493)

Abstract

By analysing the explanation of the classical heapsort algorithm via the method of levels of abstraction mainly due to Floridi, we give a concrete and precise example of how to deal with algorithmic knowledge. To do so, we introduce a concept already implicit in the method, the ‘gradient of explanations’. Analogously to the gradient of abstractions, a gradient of explanations is a sequence of discrete levels of explanation each one refining the previous, varying formalisation, and thus providing progressive evidence for hidden information. Because of this sequential and coherent uncovering of the information that explains a level of abstraction—the heapsort algorithm in our guiding example—the notion of gradient of explanations allows to precisely classify purposes in writing software according to the informal criterion of depth’, and to give a precise meaning to the notion of ‘concreteness’.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Allo, P.: Information and Logical Discrimination. In: Cooper, S.B., Dawar, A., Löwe, B. (eds.) CiE 2012. LNCS, vol. 7318, pp. 17–28. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  2. 2.
    Allo, P., Baumgaertner, B., D’Alfonso, S., Fresco, N., Gobbo, F., Grubaugh, C., Iliadis, A., Illari, P., Kerr, E., Primiero, G., Russo, F., Schulz, C., Taddeo, M., Turilli, M., Vakarelov, O., Zenil, H. (eds.): The Philosophy of Information: An Introduction. Version 1.0. Society for the Philosophy of Information (2013)Google Scholar
  3. 3.
    Allo, P.: The Logic of ‘Being Informed’ Revisited and Revised. Philosophical Studies 153(3), 417–434 (2011)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Barwise, J., Moss, L.: Vicious Circles: on the Mathematics of Non-Wellfounded Phenomena. CSLI Publications (1996)Google Scholar
  5. 5.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2001)Google Scholar
  6. 6.
    Eisenbud, D.: Commutative Algebra with a View Toward Algebraic Geometry. Graduate Texts in Mathematics, vol. 150. Springer (1995)Google Scholar
  7. 7.
    Floridi, L.: The Method of Levels of Abstraction. Minds & Machines 18(3), 303–329 (2008)CrossRefGoogle Scholar
  8. 8.
    Floridi, L.: The Philosophy of Information. Oxford University Press (2011)Google Scholar
  9. 9.
    Floridi, L.: The Ethics of Information. Oxford University Press (2013)Google Scholar
  10. 10.
    Gobbo, F., Benini, M.: What Can We Know of Computational Information? The Conceptual Re-Engineering of Measuring, Quantity, and Quality. Topoi (forthcoming)Google Scholar
  11. 11.
    Gobbo, F., Benini, M.: Why Zombies Can’t Write Significant Source Code: The Knowledge Game and the Art of Computer Programming. Journal of Experimental & Theoretical Artificial Intelligence (in publication)Google Scholar
  12. 12.
    Gobbo, F., Benini, M.: From Ancient to Modern Computing: A History of Information Hiding. IEEE Annals of the History of Computing 35(3), 33–39 (2013)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Gobbo, F., Benini, M.: The Minimal Levels of Abstraction in the History of Modern Computing. Philosophy & Technology (2013)Google Scholar
  14. 14.
    Knuth, D.E.: The Art of Computer Programming, Volume 3, Sorting and Searching, 2nd edn. Addison-Wesley (1998)Google Scholar
  15. 15.
    Primiero, G.: Offline and Online Data: on Upgrading Functional Information to Knowledge. Philosophical Studies (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Marco Benini
    • 1
  • Federico Gobbo
    • 2
  1. 1.Università degli Studi dell’InsubriaVareseItaly
  2. 2.Universiteit van AmsterdamAmsterdamThe Netherlands

Personalised recommendations