Better than a computer.

Status
Not open for further replies.
T

TheFrogger

Banned
Banned
Hi there.

I'm currently working on a program that produces a formula that tells you each number in the sequence. For example, if someone wrote a book, the formula tells you each letter in the book.

N:2468
P:1234

N is the number, p is the position.

The formula for the above is 2p. But should the program be able to produce a formula for ANY sequence, it could be useful for remembering things such as phone-numbers. :)

The program was originally designed to predict the next number in a sequence: this could be useful for all sorts of things, from lottery results, to passports through an airport. However I have concluded that it is impossible to predict a number, until that number is presented.

For example, an all encompassing formula may not be able to predict the next number in the following two sequences, from the first number.

N:123456789
N:164256756
P:123456789

However, while prediction may be futile, a formula may be drawn for a complete sequence, such as a book, or phone number.

My question for theoretical mathematicians is the following: does ANY sequence always have a formula that follows it's position in the sequence?

P:123456789
 
Last edited:
Hi again.

I've received some advice from a friend. It's along the lines of the following: there are only so many games of chess that may be played. Should we number each possible game, we may say which number was played (game six for example.)

We may do the same for a limited number of positions (a phone number, for example.) I.e. for a three digit number, I may conclude the following:

1:123
2:132
3:213
4:231
5:312
6:321

I may then successfully state which sequence may be applied. The problem with this method is that for longer positions, the number of the sequence being applied could be SO long, that the code is nob longer, "short-hand" for the sequence. The only solution I can see is for the code to be applied the the number's position in the sequence (p).
 
TheFrogger said:
Hi again.

I've received some advice from a friend. It's along the lines of the following: there are only so many games of chess that may be played. Should we number each possible game, we may say which number was played (game six for example.)

We may do the same for a limited number of positions (a phone number, for example.) I.e. for a three digit number, I may conclude the following:

1:123
2:132
3:213
4:231
5:312
6:321

I may then successfully state which sequence may be applied. The problem with this method is that for longer positions, the number of the sequence being applied could be SO long, that the code is nob longer, "short-hand" for the sequence. The only solution I can see is for the code to be applied the the number's position in the sequence (p).
Click to expand...
Think you are way out of your league

Take your chess example

There Are More Games of Chess Possible Than Atoms In The Universe. ... Well, it's estimated that there are more possibleiterations of a game of chess than there are atoms in the known universe. In fact, the number of possible moves is so vast that no one has ever been able to calculate it exactly.Jun 16, 2016

https://curiosity.com/topics/there-...ossible-than-atoms-in-the-universe-curiosity/

:)
 
TheFrogger said:
...there are more than that number of atoms in the universe.
Click to expand...

Number of atoms in the known Universe

In layman’s terms, that works out to between ten quadrillion vigintillion and one-hundred thousand quadrillion vigintillion atoms

https://www.universetoday.com/36302/atoms-in-the-universe/

But but but it seems

There Are More Games of Chess Possible Than Atoms In The Universe. ... Well, it's estimated thatthere are more possible iterations of a game of chess than there are atoms in the known universe. In fact, the number of possible moves is so vast that no one has ever been able to calculate it exactly.Jun 16, 2016

https://curiosity.com/topics/there-...ossible-than-atoms-in-the-universe-curiosity/

My $10 calculator gave up

So I am as well

Coffee time

:)
 
TheFrogger said:
...is there anything the binary theory of mathematics CANNOT do...?
Click to expand...
What is the binary of theory of mathematics? I've never heard of that.

I have a binary theory of people. There are two types of people: those who like to divide people into two types and those who don't.
 
James R said:
What is the binary of theory of mathematics? I've never heard of that.

I have a binary theory of people. There are two types of people: those who like to divide people into two types and those who don't.
Click to expand...

My binary theory of people says
  • Some like to keep people in a single group
  • Some like to divide people into two groups
  • Others like to make three or more groupings
:)
 
Michael 345 said:
Does binary function froth up like full cream milk?

I might try it

:)
Click to expand...
Try a Keurig Coffeemaker. Makes a great and consistent cup of coffee in great variety............:rolleyes:

How's this:
scl-trap.png


https://www.keurig.com/?cm_mmc=pdsc...reative_id]|pkw|keurig|pmt|e|pdv|c|product||&

I use the K-Select.
 
James R said:
What is the binary of theory of mathematics? I've never heard of that.
Click to expand...
Perhaps this alludes to "binary opposition".
A nebular opposition
(also binary system) is a pair of related terms or concepts that are opposite in meaning. Binary opposition is the system by which language and thought, two theoretical opposites are strictly defined and set off against one another. It is the contrast between two mutually exclusive terms, such as on and off, up and down, left and right.
Click to expand...
Binary opposition is an important concept of structuralism, which sees such distinctions as fundamental to all language and thought. In structuralism, a binary opposition is seen as a fundamental organizer of human philosophy, culture, and language.
Click to expand...
https://en.wikipedia.org/wiki/Binary_opposition
 
Last edited:
Actually I was referring to the truth theory that binary computing is based upon: the Boolean, "OR" operator.

Something is either true, or false. This relates to 0 (false) or 1 (true). Given that the two positions are polar opposites, the statement is true (1). Given that binary reveals truth, computing may be based upon this.
 
https://en.wikipedia.org/wiki/Computable_function
Every computable function has a finite procedure giving explicit, unambiguous instructions on how to compute it. Furthermore, this procedure has to be encoded in the finite alphabet used by the computational model, so there are only countably many computable functions.

The real numbers are uncountable so most real numbers are not computable. See computable number. The set of finitaryfunctions on the natural numbers is uncountable so most are not computable. Concrete examples of such functions are Busy beaver, Kolmogorov complexity, or any function that outputs the digits of a noncomputable number, such as Chaitin's constant.

Similarly, most subsets of the natural numbers are not computable. The halting problem was the first such set to be constructed. The Entscheidungsproblem, proposed by David Hilbert, asked whether there is an effective procedure to determine which mathematical statements (coded as natural numbers) are true.
Click to expand...
 
Status
Not open for further replies.
Back
Top