Yes: algorithms are entirely predictable from, and understandable in terms of, their physical realisations.
This is not really true, at least without adding some pretty restrictive conditions. By using “joke interpretations”, as pointed out by Searle and Putnam, one could assert that a huge number of “algorithms” supervene on any large-enough physical object.
This is not really true, at least without adding some pretty restrictive conditions. By using “joke interpretations”, as pointed out by Searle and Putnam, one could assert that a huge number of “algorithms” supervene on any large-enough physical object.