View Single Post
#159
05-22-2019, 03:24 PM
 Guest Join Date: Jan 2003 Location: Idaho Posts: 13,070
Quote:
 Originally Posted by Half Man Half Wit The difference between D implementing f and D implementing f' is one of interpretation: the states of D, or aspects thereof, are interpreted as symbolic vehicles whose semantic content pertains to the formal specification of either f or f'.
This is nonsense. I'm a computer programmer, and there is a literal, practical, real difference between implementing f and f'. This is true regardless of whether the outputs are the same for a given input. An obvious example is sorting; there are a numerous different algorithms all of which produce the same output: a sorted list. Quicksort, Mergesort, Insertion Sort, Bubble Sort, Stoogesort. However they differ internally quite a bit, and operate quite a bit differently despite producing the same output, going through states that are entirely and objectively distinct from one another. The differences between them are NOT merely a matter of 'interpretation'.

Quote:
 Originally Posted by Half Man Half Wit By specification, whether B implements CM is thus due to the particulars of CM. Hence, computationalism lapses into vicious circularity.
I'm not seeing any circularity, viscious or not. You're basically saying that if you reach into a bag of red and blue balls and happen to pull out the red one, the fact that it's red (as opposed to being blue) is due to the fact it's a red one. It's not a particularly helpful observation, but it's not circular in any sort of problematic way.

Or to put it in terms of computational processess, if you have two physically identical machines, one of which is running Quicksort and one of which is running Stoogesort, then the only thing that is making the Quicksort one the Quicksort one is the fact it's running the Quicksort one. It is distinct from the Stoogesort one (among other things it's a lot faster), but the difference in what it is is indeed a result of it being what it is.