Repository | Book | Chapter

(2013) New challenges to philosophy of science, Dordrecht, Springer.
In this paper, we investigate the invariance properties, i.e. robustness, of phenomena related to the notions of algorithm, finite procedure and explicit construction. First of all, we provide two examples of objects for which small changes completely change their (non)computational behavior. We then isolate robust phenomena in two disciplines related to computability.
Publication details
DOI: 10.1007/978-94-007-5845-2_9
Full citation:
Sanders, S. (2013)., On algorithm and robustness in a non-standard sense, in H. Andersen, D. Dieks, T. Uebel, W. J. González & G. Wheeler (eds.), New challenges to philosophy of science, Dordrecht, Springer, pp. 99-112.
This document is unfortunately not available for download at the moment.