doc_simon

WRT factoring large numbers being easy: Using the "proof by wiki link" approach:

wiki linki

So, you can see how moving to a different tool (i.e. quantum computer rather than von-Neuman) changes the difficulty of a problem. Just because people say stuff is "computationally hard" doesn't mean it is. Also, be aware of the fact that sometimes people find new ways to do maths. It's conceivable, when in the future these problems may turn out to be trivial. For example, if/when someone proves the Riemann Hypothesis (link) then we'll know a lot more about the distribution of primes.

Please leave number theory to number theorists and numerology (and its variants) to ,erm ,whatever you call yourselves.

reddish

I think they call themselves scientists these days.

Cheers from another computer science guy who likes math, by the way! :wave:

AggressiveProgressiv

HAHAHAHA check this out:

If you take the excerpt from the "Bible Code II" off of Amazon.com and use the "Bible Code" technique on the excerpt... you find out that...

"THE BIBLE CODE IS A SILLY, DUMB, FAKE, FALSE, EVIL, NASTY, DISMAL FRAUD AND SNAKE-OIL HOAX."

http://www.nmsr.org/biblecod.htm#drosnin2

Pmarra

my scientific study of the Torah is totally a different thing from the books of Drosnin

Pmarra

when I say

"I don't agree with you"

I don't make reference to

Shor's algorithm (significant because it implies that public key cryptography might be easily broken, given a sufficiently large quantum computer)

I make reference instead to the algorithm RSA

RSA Cryptosystem bases its security on the computational impossibility to factor very large numbers, that is, to break them up into prime factors.

the important thing is that the computers will always have some evident computational limits

doc_simon

Wrong. Is it possible to factor very large numbers. Some may take more time than others, but they are all still possible. (This is true on a traditional computer or a quantum computer.)

Technically you are right. But, I suspect, probably not for the right reason. Which particular limits are you thinking of (references should be made to the Church-Turing thesis, super-turing and hyper computation).

ANYWAY.....

Let's get back on track after this slight detour.

You have still yet to explain what prime numbers have to do with anything. Please explain.

Pmarra

certainly
your question is very correct

it is extremely unlikely that you can create with a computer a numerical language

it is extremely difficult in comparison to factor very large numbers

Tuvar Ane Ingolenen

Indeed.
The pdf at http://www.logonomics.it/ does not even mention primes.

doc_simon

Erm, how do you think computers work, precisley? My laptop here certainly seems programmed with a numerical language and seems pretty good at doing arithmetic. The analogue processors I research are even more "numerical", from the perspective that they do real-numbered calculations.

I'm not sure what you mean here.

Difficult in comparison to what? I can probably think of problems that are harder.

I'm STILL unclear what prime numbers have to do with the title of the bible.

Or are you suggesting it's RSA encrypted, and although it just looks like a story book it's actually something else? (people: please do not use this as an idea for a book. Yes Dan Brown, I'm talking to you )

Lemme repeat: I'm STILL unclear what prime numbers have to do with the title of the bible.

Tuvar Ane Ingolenen

please explain what you mean by 'numerical language'It is only 'difficult' because it is a lot of work with the methods and tools available today, its not really complex, or hard to understand.

And, the vast majority of 'very large numbers' can be factored quickly and easily, there are a few special ones that are 'difficult'.