Author |
Topic: Universal Truth Machine (Read 8455 times) |
|
---
Guest
|
|
Re: Universal Truth Machine
« Reply #25 on: Jan 15th, 2003, 2:55pm » |
Quote Modify
Remove
|
"this sentence is true only if it is false or undecidable but not if it's true" the other way around.
|
|
IP Logged |
|
|
|
AaronSw
Guest
|
|
Re: Universal Truth Machine
« Reply #26 on: Nov 17th, 2003, 4:03pm » |
Quote Modify
Remove
|
This problem is impossible. My UTM can always return "true", and it will never violate the requirement of the solution (which requires saying something is <em>false</em>).
|
|
IP Logged |
|
|
|
Icarus
wu::riddles Moderator Uberpuzzler
Boldly going where even angels fear to tread.
Gender:
Posts: 4863
|
|
Re: Universal Truth Machine
« Reply #27 on: Nov 17th, 2003, 5:15pm » |
Quote Modify
|
It's true that this will technically make the current form of the problem unsolvable, (tim makes the same point on August 8, 2002) but I think I could disprove your claim that it is a UTM fairly easily anyway! Perhaps the wording should be changed to "Someone has made a seemingly credible claim to have invented ...". A UTM that always answers 'true' is not even slightly credible.
|
|
IP Logged |
"Pi goes on and on and on ... And e is just as cursed. I wonder: Which is larger When their digits are reversed? " - Anonymous
|
|
|
Patashu
Newbie
Gender:
Posts: 18
|
|
Re: Universal Truth Machine
« Reply #28 on: Sep 1st, 2004, 3:14am » |
Quote Modify
|
on Sep 8th, 2002, 11:02pm, zarathustra wrote:I understand that there is a problem that the universal truth machine is impossible if it simply prints out true, false, or undecidable. But how about if it was a little more intelligent? How about it prints out true, false, or if there is some sort of paradox involved then it explained exactly what the problem is and why it would never be able to give a correct result. I wonder if there would still be a way to foul it up... |
| Easy. Tell the UTM: "You will answer this statement with something besides true." If it says true, then it's proven the statement false. If it says false, then it's proven the statement true. If it says undecided, then it's proven the statement true, thus it is decided. If it explains the paradox, it's proven the statement true besides realizing how it works. It can't win! (unless I missed something)
|
|
IP Logged |
|
|
|
BNC
Uberpuzzler
Gender:
Posts: 1732
|
|
Re: Universal Truth Machine
« Reply #29 on: Sep 1st, 2004, 6:13am » |
Quote Modify
|
on Sep 1st, 2004, 3:14am, Patashu wrote: Easy. Tell the UTM: "You will answer this statement with something besides true." If it says true, then it's proven the statement false. If it says false, then it's proven the statement true. If it says undecided, then it's proven the statement true, thus it is decided. If it explains the paradox, it's proven the statement true besides realizing how it works. It can't win! (unless I missed something) |
| You: "You will answer this statement with something besides true." UTM: "That's right, Sir. I have just answered with something besides 'true'. "
|
|
IP Logged |
How about supercalifragilisticexpialidociouspuzzler [Towr, 2007]
|
|
|
rmsgrey
Uberpuzzler
Gender:
Posts: 2873
|
|
Re: Universal Truth Machine
« Reply #30 on: Sep 1st, 2004, 2:53pm » |
Quote Modify
|
"Your response to this statement will not indicate it to be true"
|
|
IP Logged |
|
|
|
BNC
Uberpuzzler
Gender:
Posts: 1732
|
|
Re: Universal Truth Machine
« Reply #31 on: Sep 1st, 2004, 3:46pm » |
Quote Modify
|
Anyway, the way I see it, it's a clear "undecidable".
|
|
IP Logged |
How about supercalifragilisticexpialidociouspuzzler [Towr, 2007]
|
|
|
rmsgrey
Uberpuzzler
Gender:
Posts: 2873
|
|
Re: Universal Truth Machine
« Reply #32 on: Sep 2nd, 2004, 6:29am » |
Quote Modify
|
The fun comes from the fact that, while the UTM cannot answer the statement correctly, any other person can.
|
|
IP Logged |
|
|
|
jonderry
Newbie
Posts: 18
|
|
Re: Universal Truth Machine
« Reply #33 on: Sep 13th, 2004, 5:06pm » |
Quote Modify
|
I see how it is possible to devise a proposition that the UTM will not be able to correctly solve, however I don't see how to ensure that the proposition is true; suppose there were such a proposition, then the UTM could simply repond "true" unless that made the claim false (in which case the proposition was not necessarily true). Am I missing something?
|
|
IP Logged |
|
|
|
andrewcc32459
Guest
|
|
Re: Universal Truth Machine
« Reply #34 on: Jun 11th, 2005, 6:06pm » |
Quote Modify
Remove
|
Ask it "Will the Universal Truth Machine say that the answer to this question is false?" It cant say true because then the answer would be false It cant say undecidable because then the answer would be false
|
|
IP Logged |
|
|
|
slapee
Newbie
Posts: 2
|
|
Re: Universal Truth Machine
« Reply #35 on: Nov 27th, 2005, 8:16pm » |
Quote Modify
|
how about asking the UTF a question that can be interpreted more than one way (e.g "0^0 = 0". this can either be true or false depending on how you look at it, since 0 times anything = 0, but anything^0 = 1.) ? would this work, or does the statement have to be boring and have only one interpretation?
|
|
IP Logged |
|
|
|
Icarus
wu::riddles Moderator Uberpuzzler
Boldly going where even angels fear to tread.
Gender:
Posts: 4863
|
|
Re: Universal Truth Machine
« Reply #36 on: Nov 28th, 2005, 7:35pm » |
Quote Modify
|
It would answer that one with "0^0 = 1", since that is the definition. It is far more useful to define 0^0 = 1 than it is to define it to be 0, or to leave it undefined, so the decision was made long ago to choose 1 as its value. This definition is universally accepted. The fact that 0 times anything = 0 does not enter into this, since 0^0 does not involve multiplying 0 by anything. (The rule that 0 raised to any power is 0 is false. The correct rule is "0 raised to any power other than 0 is 0".)
|
|
IP Logged |
"Pi goes on and on and on ... And e is just as cursed. I wonder: Which is larger When their digits are reversed? " - Anonymous
|
|
|
|