Sentence examples for between the computational states from inspiring English sources

Chalmers and Copeland argue that this is illegitimate, as a genuine implementation must exhibit the same counterfactual relations that obtain between the computational states.

In addition, both Chalmers (1995, 1996) and Copeland (1996) argue that the mappings invoked by unlimited pancomputationalism violate the counterfactual relations between the computational states.

In other words, the pure counterfactual account requires the mapping between computational and physical descriptions to be such that the counterfactual relations between the physical states are isomorphic to the counterfactual relations between the computational states.

This response leads to the counterfactual account of computation, according to which the counterfactual relations between the physical states must be isomorphic to the counterfactual relations between the computational states.

According to the simple mapping account, a physical system S performs computation C just in case (i) there is a mapping from the states ascribed to S by a physical description to the states defined by computational description C, such that (ii) the state transitions between the physical states mirror the state transitions between the computational states.

Unlike the computational states of digital computers, qubits are not unambiguously distinguishable from one another.

He emphasizes probabilistic automata, which are similar to Turing machines except that transitions between computational states are stochastic.

On the individuation of computational states, the main debate divides internalists from externalists.

Thus, the maximum number of computational states per hour h will be 104 states.

Thus, there are not enough computational states for the physical states to map onto.

According to internalists, A and B are in computational states of the same type.