Re: DDD correctly emulated by H0 -- Ben agrees that Sipser approved criteria is met

On 2024-06-28 12:40:57 +0000, olcott said:

On 6/28/2024 3:30 AM, Mikko wrote:

On 2024-06-27 16:56:56 +0000, olcott said:
 

On 6/27/2024 10:35 AM, Mikko wrote:

On 2024-06-27 14:10:02 +0000, olcott said:

 In computability theory and computational complexity theory, a
decision problem is a computational problem that can be posed as
a yes–no question of the input values.
https://en.wikipedia.org/wiki/Decision_problem

 That's right. But that question cannot be presented to the decider.
Only the input values can.
 

In other words you are saying that Turing machines do not
typically understand English.

 I didn't mean it that generally, only about deciders, but yes, typical
Turing machines do not understand any English. More specifically, the
specification of a halt decider (or any typical decider) prevents it
from being asked in any language.
 

 // The question: Is x > y ?
bool GreaterThan(int x, int y) { return (x > y); }
 Deciders are always asked a yes/no question of their
inputs in their own native language.

A call of GreaterThan must give two integers as arguments. There
is no place where a question could be put. An integer is not a
question.
--
Mikko