On algorithm and robustness in a non-standard sense
pp. 99-112
Abstract
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
Published in:
Andersen Hanne, Dieks Dennis, Uebel Thomas, González Wenceslao J., Wheeler Gregory (2013) New challenges to philosophy of science. Dordrecht, Springer.
Pages: 99-112
DOI: 10.1007/978-94-007-5845-2_9
Full citation:
Sanders Sam (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, 99–112.