The continuum hypothesis is undecidable in certain versions of set theory. Why couldn't the Riemann hypothesis be undecidable too?
My understanding of Gödel is that in any sufficiently strong system of axioms there will always be statements that are neither provable nor disprovable. That is: there is a statement S such that S isn't provable and the negation of S isn't provable.
Cell phones with encryption capabilities has been available since at least 1999. The
Tiger cell phone from Sectra has been available for more than four years now.
I don't think there is a very large demand for it though. People just don't care enough about their privacy to compensate for the disadvantages.
Generics in Java will actually box primitive types. This makes them run about as fast as LISP, and forces you to write a "native" implementation -- which pretty much defeats the purpose of having template libraries in the first place.
Java with generics will probably still be a lot slower than Common Lisp. Despite common belief, common lisp is quite fast and can be compiled on a lot of platforms.
The strenght of the encryption is the difficultly of factoring the very large (non-prime) number. Until a non-linear factoring technique is developed, such encryption schemes will continue to be viable.I haven't seen yet any real research that quantum computing will be able to do this - but who knows.
Do a search on google for Shor's algorithm. It can factor a product of two primes in O((log N)^3) time.
Myth number one: if you can efficiently factorize large integers, you've
broken today's best encryption schemes. This is not true. In fact, you must solve the
*discrete logarithm* problem in polynomial time in order to break today's encryption
schemes.
The RSA cryptosystem relies on that factorization is a hard problem. If you find an efficient algorithm to the factorization problem you have broken RSA. RSA may not be the best cryptosystem but it is widely used.
From the RSA Laboratories FAQ 4.0:
Question 3.1.3
The most damaging would be for an attacker to
discover the private key corresponding to a given public key; this would enable the attacker both to read all
messages encrypted with the public key and to forge signatures. The obvious way to do this attack is to factor the
public modulus, n, into its two prime factors, p and q. From p, q, and e, the public exponent, the attacker can easily
get d, the private exponent. The hard part is factoring n; the security of RSA depends on factoring being difficult.
Yep the speed of light is exactly 299,792,458 m/s in vaccuum. A second is defined as the time required for 9,192,631,770 vibrations of a Cs atom. Read about it here
The cache isn't completely useless. You are right about the images but all the formulas are embedded in the html as comments in latex syntax. A perl script to fix the links wouldn't be too hard to code.
Slashdot Mirror
The continuum hypothesis is undecidable in certain versions of set theory. Why couldn't the Riemann hypothesis be undecidable too?
My understanding of Gödel is that in any sufficiently strong system of axioms there will always be statements that are neither provable nor disprovable. That is: there is a statement S such that S isn't provable and the negation of S isn't provable.
Is my understanding of Gödel wrong?
Cell phones with encryption capabilities has been available since at least 1999. The Tiger cell phone from Sectra has been available for more than four years now.
I don't think there is a very large demand for it though. People just don't care enough about their privacy to compensate for the disadvantages.
Encrypted cell phones has been around for quite some time now. The Tiger cell phone from Sectra Communication Systems has been available since 1999.
Generics in Java will actually box primitive types. This makes them run about as fast as LISP, and forces you to write a "native" implementation -- which pretty much defeats the purpose of having template libraries in the first place.
Java with generics will probably still be a lot slower than Common Lisp. Despite common belief, common lisp is quite fast and can be compiled on a lot of platforms.
Do a search on google for Shor's algorithm. It can factor a product of two primes in O((log N)^3) time.
1. It still doesn't fully supports ASX files (yes, even with the latest CVS - I tried one from yesterday).
Why don't you report it as a bug?
MPlayer doesn't work within browsers.
Try plugger
MPlayer does not, and according to its developers, will not ever play audio files
Try the latest CVS version of MPlayer. It has support for audio only files.
Click on a message. Click on "View this article only" and then "Original Format". And there it is. Plain old text. With Message-ID and all.
In fact, some C programs have done quite well in previous years -- they just haven't managed to win.
What about Cilk Pousse? It looks pretty much like C to me... And they won the ICFP contest '98.
It's possible to do iteration with the C preprocessor. One example of it is http://www.ioccc.org/years-spoiler.html#1995_vansc hnitz
It is basically a file that #includes itself. Don't know if it's Turing complete though.
Try to compile that code with -Wall (with gcc) and you get:
test.cpp:3: return type for `main' changed to `int'
Myth number one: if you can efficiently factorize large integers, you've broken today's best encryption schemes. This is not true. In fact, you must solve the *discrete logarithm* problem in polynomial time in order to break today's encryption schemes.
The RSA cryptosystem relies on that factorization is a hard problem. If you find an efficient algorithm to the factorization problem you have broken RSA. RSA may not be the best cryptosystem but it is widely used.
From the RSA Laboratories FAQ 4.0: Question 3.1.3 The most damaging would be for an attacker to discover the private key corresponding to a given public key; this would enable the attacker both to read all messages encrypted with the public key and to forge signatures. The obvious way to do this attack is to factor the public modulus, n, into its two prime factors, p and q. From p, q, and e, the public exponent, the attacker can easily get d, the private exponent. The hard part is factoring n; the security of RSA depends on factoring being difficult.
Check http://www.freedb.org/sections.php?op=viewarticle& artid=11
and
http://www.freedb.org/sections.php?op=viewarticle& artid=10
Yep the speed of light is exactly 299,792,458 m/s in vaccuum. A second is defined as the time required for 9,192,631,770 vibrations of a Cs atom. Read about it here
The cache isn't completely useless. You are right about the images but all the formulas are embedded in the html as comments in latex syntax. A perl script to fix the links wouldn't be too hard to code.
All the equations are embedded in the html as comments in latex syntax. It's quite easy to make a little perl script creates thoose gif images again.