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’.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Allo, P.: The Logic of ‘Being Informed’ Revisited and Revised. Philosophical Studies 153(3), 417–434 (2011)
Barwise, J., Moss, L.: Vicious Circles: on the Mathematics of Non-Wellfounded Phenomena. CSLI Publications (1996)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2001)
Eisenbud, D.: Commutative Algebra with a View Toward Algebraic Geometry. Graduate Texts in Mathematics, vol. 150. Springer (1995)
Floridi, L.: The Method of Levels of Abstraction. Minds & Machines 18(3), 303–329 (2008)
Floridi, L.: The Philosophy of Information. Oxford University Press (2011)
Floridi, L.: The Ethics of Information. Oxford University Press (2013)
Gobbo, F., Benini, M.: What Can We Know of Computational Information? The Conceptual Re-Engineering of Measuring, Quantity, and Quality. Topoi (forthcoming)
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)
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)
Gobbo, F., Benini, M.: The Minimal Levels of Abstraction in the History of Modern Computing. Philosophy & Technology (2013)
Knuth, D.E.: The Art of Computer Programming, Volume 3, Sorting and Searching, 2nd edn. Addison-Wesley (1998)
Primiero, G.: Offline and Online Data: on Upgrading Functional Information to Knowledge. Philosophical Studies (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Benini, M., Gobbo, F. (2014). Algorithms and Their Explanations. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham. https://doi.org/10.1007/978-3-319-08019-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-08019-2_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08018-5
Online ISBN: 978-3-319-08019-2
eBook Packages: Computer ScienceComputer Science (R0)