Algorithms and Their Explanations
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’.
KeywordsSoftware Designer Algorithm Designer Algorithmic Information Modern Computing Sorting Problem
Unable to display preview. Download preview PDF.
- 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
- 4.Barwise, J., Moss, L.: Vicious Circles: on the Mathematics of Non-Wellfounded Phenomena. CSLI Publications (1996)Google Scholar
- 5.Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2001)Google Scholar
- 6.Eisenbud, D.: Commutative Algebra with a View Toward Algebraic Geometry. Graduate Texts in Mathematics, vol. 150. Springer (1995)Google Scholar
- 8.Floridi, L.: The Philosophy of Information. Oxford University Press (2011)Google Scholar
- 9.Floridi, L.: The Ethics of Information. Oxford University Press (2013)Google Scholar
- 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.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
- 13.Gobbo, F., Benini, M.: The Minimal Levels of Abstraction in the History of Modern Computing. Philosophy & Technology (2013)Google Scholar
- 14.Knuth, D.E.: The Art of Computer Programming, Volume 3, Sorting and Searching, 2nd edn. Addison-Wesley (1998)Google Scholar
- 15.Primiero, G.: Offline and Online Data: on Upgrading Functional Information to Knowledge. Philosophical Studies (2012)Google Scholar