Quote:
Originally Posted by wolfpup
It depends on what question you're asking. If you're concerned about whether a device is Turing equivalent, you need to understand what it's actually doing. But when computation is viewed simply as the output of a black box, it's always reducible to the mapping of a set of input symbols to a set of output symbols. So I take the view that any black box that deterministically produces such a mapping for all combinations of inputs has to be regarded as ipso facto computationally equivalent to any other that produces the same mapping, without reference to what's going on inside it. Of course, the mechanisms involved may be trivial, like a simple table lookup, that may not provide any insights into the nature of computation and may not be Turing equivalent.

The question I'm asking is whether the nature of the machinery performing a transformation determines whether something is a computation or not, from your perspective.
It sounds like you are saying that if HMHW's box performs the transformation you listed (0110011 into 0100010) then that is considered a computation, right?
Meaning that HMWH's box may not be a Turing machine, it may just be a circuit that performs that transformation, but regardless of how it arrives at the correct answer, the transformation is considered a computation, right?
198
