Re: ZFC solution to incorrect questions: reject them (NFFC)

On 3/12/24 3:40 PM, olcott wrote:

On 3/12/2024 5:11 PM, immibis wrote:

On 12/03/24 22:42, olcott wrote:

ZFC removed logically impossible decision problem instances. My new
foundation for computation (NFFC) only removes logically impossible
decision problem instances. Turing machines remain the same.

>
If Turing machines remain the same, then every halt decider still has a Turing machine which it gets wrong.

 Turing machines can remain the same yet the notion of computation
would change. Undecidable inputs simply become construed as semantically
invalid inputs.
 

You better watch out with that. "Inputs" aren't "Undecidable", Mappings / Problems are.
After all the input (H^) (H^) can be correctly decide by a lot of deciders.
If you try to define that the input that a machine gets wrong are just invalid to give it, the ANY random decider is an ANYTHING decider, as the inputs it happens to get right it gets right, and the rest just were incorrect to give to it.
That also means, you don't know if it was valid to ask the decider that input, and deciding if you can give that input to the decider is probably an uncomputable problem, so you end up not being able to trust any deciders answer.