Simplified Halting Problem Proof Rebuttal

What is the basis for reason? And mathematics?

Moderators: AMod, iMod

Skepdick
Posts: 14504
Joined: Fri Jun 14, 2019 11:16 am

Re: Simplified Halting Problem Proof Rebuttal

Post by Skepdick »

PeteOlcott wrote: Tue Oct 17, 2023 11:02 pm
Skepdick wrote: Tue Oct 17, 2023 7:50 pm
PeteOlcott wrote: Tue Oct 17, 2023 6:55 pm Computer science deciders are only allowed to take actions that
are equivalent to a Boolean return value. Every other action is
stipulated to be incorrect.
Nowhere does it stipulate that I can't encapsulate a Boolean in a Maybe monad.
It seems that you have reverted back to being a Troll
You know that deciders can only do the equivalent of returning a Boolean.
Stop lying.

What does this decider return and when?
In [1]: def greaterThanOne(x):
...: while True: pass
...: return x > 1
...:

In [2]: greaterThanOne(5)
That's a Maybe Boolean, not a Boolean.
PeteOlcott
Posts: 1514
Joined: Mon Jul 25, 2016 6:55 pm

Re: Simplified Halting Problem Proof Rebuttal

Post by PeteOlcott »

Skepdick wrote: Tue Oct 17, 2023 7:50 pm
PeteOlcott wrote: Tue Oct 17, 2023 6:55 pm Computer science deciders are only allowed to take actions that
are equivalent to a Boolean return value. Every other action is
stipulated to be incorrect.
Nowhere does it stipulate that I can't encapsulate a Boolean in a Maybe monad.
So you really didn't know that all Deciders are always Boolean?
Well now you know.
Skepdick
Posts: 14504
Joined: Fri Jun 14, 2019 11:16 am

Re: Simplified Halting Problem Proof Rebuttal

Post by Skepdick »

PeteOlcott wrote: Wed Oct 18, 2023 5:44 am
Skepdick wrote: Tue Oct 17, 2023 7:50 pm
PeteOlcott wrote: Tue Oct 17, 2023 6:55 pm Computer science deciders are only allowed to take actions that
are equivalent to a Boolean return value. Every other action is
stipulated to be incorrect.
Nowhere does it stipulate that I can't encapsulate a Boolean in a Maybe monad.
So you really didn't know that all Deciders are always Boolean?
Well now you know.
You are necessarily claiming that this is NOT a decider then. Explain why.

Code: Select all

def isGreaterThanOne(x):
	while True: pass
	return x > 1
PeteOlcott
Posts: 1514
Joined: Mon Jul 25, 2016 6:55 pm

Re: Simplified Halting Problem Proof Rebuttal

Post by PeteOlcott »

Skepdick wrote: Wed Oct 18, 2023 5:45 am
You are necessarily claiming that this is NOT a decider then. Explain why.
You are playing head games: Explain

I am saying that any "Maybe" return value cannot exist.
You already know that I aleady know that you know that.
Skepdick
Posts: 14504
Joined: Fri Jun 14, 2019 11:16 am

Re: Simplified Halting Problem Proof Rebuttal

Post by Skepdick »

PeteOlcott wrote: Wed Oct 18, 2023 5:58 am
Skepdick wrote: Wed Oct 18, 2023 5:45 am
You are necessarily claiming that this is NOT a decider then. Explain why.
You are playing head games: Explain

I am saying that any "Maybe" return value cannot exist.
You already know that I aleady know that you know that.
It's not a return value. It defines the behaviour of the decider.

MAYBE it will return a Boolean.
PeteOlcott
Posts: 1514
Joined: Mon Jul 25, 2016 6:55 pm

Re: Simplified Halting Problem Proof Rebuttal

Post by PeteOlcott »

Skepdick wrote: Wed Oct 18, 2023 6:01 am
PeteOlcott wrote: Wed Oct 18, 2023 5:58 am
Skepdick wrote: Wed Oct 18, 2023 5:45 am
You are necessarily claiming that this is NOT a decider then. Explain why.
You are playing head games: Explain

I am saying that any "Maybe" return value cannot exist.
You already know that I aleady know that you know that.
It's not a return value. It defines the behaviour of the decider.

MAYBE it will return a Boolean.
Deciders process Decision Problems
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
Skepdick
Posts: 14504
Joined: Fri Jun 14, 2019 11:16 am

Re: Simplified Halting Problem Proof Rebuttal

Post by Skepdick »

PeteOlcott wrote: Wed Oct 18, 2023 6:11 am
Skepdick wrote: Wed Oct 18, 2023 6:01 am
PeteOlcott wrote: Wed Oct 18, 2023 5:58 am

You are playing head games: Explain

I am saying that any "Maybe" return value cannot exist.
You already know that I aleady know that you know that.
It's not a return value. It defines the behaviour of the decider.

MAYBE it will return a Boolean.
Deciders process Decision Problems
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
I don't need an abstract definition removed from anything concrete. Here is this particular Python program. Go ahead and decide.

Does it return a Boolean? [Yes/No] <--- Decision problem.

Code: Select all

def isGreaterThanOne(x):
	while True: pass
	return x > 1
PeteOlcott
Posts: 1514
Joined: Mon Jul 25, 2016 6:55 pm

Re: Simplified Halting Problem Proof Rebuttal

Post by PeteOlcott »

Skepdick wrote: Wed Oct 18, 2023 6:32 am I don't need an abstract definition removed from anything concrete. Here is this particular Python program. Go ahead and decide.

Does it return a Boolean? [Yes/No] <--- Decision problem.
Until you agree that a computer science decider must always return
Boolean and is abolutely not allowed to return anything else this
dialogue is over. I can't afford to tolerate head games.
Skepdick
Posts: 14504
Joined: Fri Jun 14, 2019 11:16 am

Re: Simplified Halting Problem Proof Rebuttal

Post by Skepdick »

PeteOlcott wrote: Wed Oct 18, 2023 3:18 pm Until you agree that a computer science decider must always return
Boolean and is abolutely not allowed to return anything else this
dialogue is over. I can't afford to tolerate head games.
You say head games - I say thinking.

Is a Boolean decider allowed to NOT return anything?

Code: Select all

def nonHaltingBooleanDecider():
   from random import choice
   while 1:0
   return choice([True, False])

Code: Select all

def HaltingBooleanDecider():
   from random import choice
   return choice([True, False])
Last edited by Skepdick on Wed Oct 18, 2023 3:34 pm, edited 1 time in total.
PeteOlcott
Posts: 1514
Joined: Mon Jul 25, 2016 6:55 pm

Re: Simplified Halting Problem Proof Rebuttal

Post by PeteOlcott »

Skepdick wrote: Wed Oct 18, 2023 3:29 pm
PeteOlcott wrote: Wed Oct 18, 2023 3:18 pm Until you agree that a computer science decider must always return
Boolean and is abolutely not allowed to return anything else this
dialogue is over. I can't afford to tolerate head games.
You say head games - I say thinking.

Is a Boolean decider allowed to NOT halt?
All deciders are Boolean and are required to halt.
Skepdick
Posts: 14504
Joined: Fri Jun 14, 2019 11:16 am

Re: Simplified Halting Problem Proof Rebuttal

Post by Skepdick »

PeteOlcott wrote: Wed Oct 18, 2023 3:34 pm All deciders are Boolean and are required to halt.
Halt when?
After 1 second; or ω seconds; or ω^ω seconds ?

Image
PeteOlcott
Posts: 1514
Joined: Mon Jul 25, 2016 6:55 pm

Re: Simplified Halting Problem Proof Rebuttal

Post by PeteOlcott »

Skepdick wrote: Wed Oct 18, 2023 3:34 pm
PeteOlcott wrote: Wed Oct 18, 2023 3:34 pm All deciders are Boolean and are required to halt.
Halt when?
After 1 second; or ω seconds; or ω^ω seconds ?
Anything less than eternity counts as halting.
In the case of my fully operational decider it
never takes more than five seconds.
Skepdick
Posts: 14504
Joined: Fri Jun 14, 2019 11:16 am

Re: Simplified Halting Problem Proof Rebuttal

Post by Skepdick »

PeteOlcott wrote: Wed Oct 18, 2023 3:41 pm Anything less than eternity counts as halting.
Anything less than which eternity?

Every one of those ordinals is an eternity greater than our universe.
Eternity greater than all possible universes.

It'll halt. Eventually. Just die and wait.

Image
PeteOlcott
Posts: 1514
Joined: Mon Jul 25, 2016 6:55 pm

Re: Simplified Halting Problem Proof Rebuttal

Post by PeteOlcott »

Skepdick wrote: Wed Oct 18, 2023 3:45 pm
PeteOlcott wrote: Wed Oct 18, 2023 3:41 pm Anything less than eternity counts as halting.
Anything less than which eternity?

Every one of those ordinals is an eternity greater than our universe.
Eternity greater than all possible universes.

It'll halt. Eventually. Just die and wait.
Let me know when you want to get back to an honest dialogue.
Until then I am done with you.
Skepdick
Posts: 14504
Joined: Fri Jun 14, 2019 11:16 am

Re: Simplified Halting Problem Proof Rebuttal

Post by Skepdick »

PeteOlcott wrote: Wed Oct 18, 2023 3:50 pm Let me know when you want to get back to an honest dialogue.
Until then I am done with you.
I am having an honest dialogue. Let me know when you want to stop lying about me.
Until then I am done with you.
Post Reply