I guess the only quibble I would have, and I don’t know that it really changes your critique much, is that I wrote that neurons would be some sort of gate equivalent. I wouldn’t say that neurons have a simple gate model (that they’re simply an AND or an XOR, for instance). But I do see them as being in some sense Boolean. Anyway, I would just try to clarify my fairly short answer to say that I believe that computation can always be broken down into smaller Boolean steps, and these steps could be rendered in many different media.
Computationality in any fashion needs to be reified by physics doesn’t it? Otherwise it wouldn’t exist. Now, I would say it’s an emergent feature; physics doesn’t need to provide anything beyond what is provided for anything else to explain it. Maybe that’s the point of contention?
I’m not trying to hold you to any Platonic claim that there’s any unique set of computational primitives that are more ontologically privileged than others. It’s of course perfectly equivalent to say that it’s NOR gates that are primitive, or that you should be using gates with three-state rather than two state inputs, or whatever. But whatever set of primitives you settle on, you need to settle on something, and I don’t think there’s any such something which invalidates my claim about K-complexity when expressed in formal language familiar to physics.
I guess the only quibble I would have, and I don’t know that it really changes your critique much, is that I wrote that neurons would be some sort of gate equivalent. I wouldn’t say that neurons have a simple gate model (that they’re simply an AND or an XOR, for instance). But I do see them as being in some sense Boolean. Anyway, I would just try to clarify my fairly short answer to say that I believe that computation can always be broken down into smaller Boolean steps, and these steps could be rendered in many different media.
Computationality in any fashion needs to be reified by physics doesn’t it? Otherwise it wouldn’t exist. Now, I would say it’s an emergent feature; physics doesn’t need to provide anything beyond what is provided for anything else to explain it. Maybe that’s the point of contention?
I’m not trying to hold you to any Platonic claim that there’s any unique set of computational primitives that are more ontologically privileged than others. It’s of course perfectly equivalent to say that it’s NOR gates that are primitive, or that you should be using gates with three-state rather than two state inputs, or whatever. But whatever set of primitives you settle on, you need to settle on something, and I don’t think there’s any such something which invalidates my claim about K-complexity when expressed in formal language familiar to physics.