mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2008-04-08, 18:47   #1
victor
 
victor's Avatar
 
Oct 2005
Fribourg, Switzerlan

22·32·7 Posts
Default Berry paradox without paradox.

Let n be the smallest positive integer not definable in under two words.

A friend of mine is unsure whether n can be found at all, and believes n is uncomputable in virtue of the equivocity of the English language (there are infinite ways of describing n, and one can therefore never be sure that any given description of a number is the shortest). The problem, he says, may seem more evident if you change "under two words" by "under three words", four, five, etc... (Obviously not going any higher than ten.)

Any advice ?

PS : This friend of mine studies philosophy...
victor is offline   Reply With Quote
Old 2008-04-08, 19:12   #2
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

22·1,549 Posts
Default

Quote:
Originally Posted by victor View Post
Let n be the smallest positive integer not definable in under two words.

A friend of mine is unsure whether n can be found at all, and believes n is uncomputable in virtue of the equivocity of the English language (there are infinite ways of describing n, and one can therefore never be sure that any given description of a number is the shortest). The problem, he says, may seem more evident if you change "under two words" by "under three words", four, five, etc... (Obviously not going any higher than ten.)

Any advice ?

PS : This friend of mine studies philosophy...
If every number were to eventually get a name (like googol, Grahams number, etc.) then that name could conceivably be only one word. So I think it comes down to how long do you want to wait to see how many numbers get one word names. At some point you have to make a cut-off and say "up to this point in time the smallest positive integer not definable in under two words is [whatever it is]".
retina is offline   Reply With Quote
Old 2008-04-08, 19:56   #3
axn
 
axn's Avatar
 
Jun 2003

22×3×421 Posts
Default

Assuming a static vocabulary (i.e. the list of allowable "words" is constant) and unique interpretation (i.e. one specific sequence of word can define at most one number), then it is a simple matter of iterating thru all single-word and two-word sequences, and then finding out the smallest number not represented by them.

Isn't it?
axn is online now   Reply With Quote
Old 2008-04-08, 20:42   #4
m_f_h
 
m_f_h's Avatar
 
Feb 2007

1101100002 Posts
Default

Quote:
Originally Posted by victor View Post
Let n be the smallest positive integer not definable in under two words.
any integer can be defined by just writing it down (theoretically), i.e. with 1 string of digits.

and, there are certainly languages in which all numbers are spelled as one single word.

and and and....

Philosophy can be scientific, but often people in that field just produce nonsense.
m_f_h is offline   Reply With Quote
Old 2008-04-08, 20:43   #5
Wacky
 
Wacky's Avatar
 
Jun 2003
The Texas Hill Country

32×112 Posts
Default

Quote:
Originally Posted by axn1 View Post
Assuming a static vocabulary (i.e. the list of allowable "words" is constant) and unique interpretation (i.e. one specific sequence of word can define at most one number), then it is a simple matter of iterating thru all single-word and two-word sequences, and then finding out the smallest number not represented by them.
Quote:
not definable in under two words
"Under two" limits it to single words. With a fixed vocabulary, the task is rather trivial.

"Not more than two" is more interesting.
And adding one more really opens up the possibilities.
Wacky is offline   Reply With Quote
Old 2008-04-08, 20:50   #6
m_f_h
 
m_f_h's Avatar
 
Feb 2007

24·33 Posts
Default

Quote:
Originally Posted by axn1 View Post
Assuming a static vocabulary (i.e. the list of allowable "words" is constant) and unique interpretation (i.e. one specific sequence of word can define at most one number), then it is a simple matter of iterating thru all single-word and two-word sequences, and then finding out the smallest number not represented by them. Isn't it?
no, since there are 2-word combinations whose meaning is not clear and/or may depend on (i.e. vary with) the historical context (e.g. "known primes"...)
and, for some word combinations it cannot be said, by principle, what they represent, they are ill-defined, like "the set of all sets", or "this phrase is a lie", or so.
To be concrete, the "leastbiwordundefinable number" cannot exist.

PS: if vou don't like "leastbiwordundefinable", call these numbers "infraperfect". So you are looking for the "smallest infraperfect". It cannot exist.

Last fiddled with by m_f_h on 2008-04-08 at 20:55 Reason: added PS with historical word creation
m_f_h is offline   Reply With Quote
Old 2008-04-08, 21:09   #7
bsquared
 
bsquared's Avatar
 
"Ben"
Feb 2007

3×1,171 Posts
Default

This sounds similar to this thread:
http://www.mersenneforum.org/showthread.php?t=9546, in which one or more posts contain web links to a consistent methodology for speaking or writing any number. Everyone must agree on the rules before everyone can agree on an answer to this puzzle. That is what we did in the above thread...
bsquared is offline   Reply With Quote
Old 2008-04-08, 22:34   #8
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

2×3×7×233 Posts
Default

There are ways to construct a single word for a number. I think that this can be done through about 21.
Uncwilly is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Coin Paradox petrw1 Puzzles 1 2015-02-06 23:17
mathematical paradox? ixfd64 Lounge 21 2005-09-29 21:17
paradox? Orgasmic Troll Lounge 10 2003-07-13 09:45

All times are UTC. The time now is 02:50.


Sat Jul 17 02:50:43 UTC 2021 up 50 days, 37 mins, 1 user, load averages: 1.30, 1.46, 1.45

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.