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.
CITATION STYLE
Sanders, S. (2013). On algorithm and robustness in a non-standard sense. In New Challenges to Philosophy of Science (pp. 99–112). Springer Netherlands. https://doi.org/10.1007/978-94-007-5845-2_9
Mendeley helps you to discover research relevant for your work.