A simulation can be guaranteed to not be a person if it is not Turing complete.
What does that mean? A single run of an algorithm can’t be said to be Turing complete or incomplete. Completeness is a property of algorithms taken as functions over all possible inputs.
What does that mean? A single run of an algorithm can’t be said to be Turing complete or incomplete. Completeness is a property of algorithms taken as functions over all possible inputs.