That statement was almost true until around 2007-2009 were the processor industry switched from an exponential cpu speed function to a linear or logarithmic one...
Definitions
n : floored integer
s : cpu speed
l : float between 0[ and ]1
p : float between [1 2[
s(n) : speed at month n The function for Moore's law
s(0) : some number
s(n) : s(n/18)*2 A linear speed function
s(0) : some number
s(n) : l*(n-1) A logarithmic speed function
s(0) : some number
s(n) : p*(n-1)
That shift is significant, now I.A. researchers must also consider speed and parallelism, they cannot rely on Moore's anymore...
I used to hate WebSphere with a passion but learning JACL made me love the poor misunderstood abomination that is WebSphere.
Everything is scriptable, and I mean Everything . I had a bash scripter learn it. And now we have the ability to remotely deploy a full WebSphere installation on an server already running up to 8 other installations, configure it, install the requested applications! All that from a shell based wizard. The actual utilization of the script is about 30 seconds long and it's execution time is about 20 minutes long if you also want to install a couple of applications. The wizard takes care of everything in one pass except evidently the installation of the yet to be generated CSR reply. However, the wizard also takes care of that if you select install received CSR CRT reply's....
HOWEVER, the above message only applies to WebSphere, no an atrocity with a name like WebSphere Lotus Inventory Maximo Enterprise Management EditionIf a product from IBM with a name designed by chtulu himself is under you care, I am sorry for you
You are confusing over abstraction and SAP bad use of languages with Java. I have seen SAP Java, ABAP and even some SAP C, systematically it was suffering from lasagna architecture and insane naming conventions, however that bad style is portable across languages.
I just want for someone to prove the Church-Turing conjecture for the set of all finite programs<->calclus. I specified finite as PM breaks down when dealing with an infinite number of elements into a set and Godel do not applies here as I do not search the truth value of a proposition, only a mapping D->P as I transform the parsing and interpretation of a finite description D to an hypothetical lambda calculus problem P. As long as all descriptions are finite and that the Church-Turing conjecture holds true, my conjecture is safe. Sure, there is no usefulness in that transformation, it's only a device to show that at least one mathematical description must exist.
I wish I could address your remark on Tractatus Logico-Philosophicus but I lack knowledge of that book to address your concerns.
And lastly, the project in Principia Mathematica is, in my humble opinion, not failed but it is incomplete and limited to finite sets.
I would argue that every non-mathematical correct description of nature is transformable into math by involving the Church-Turing lambda-reductibility thesis.
Axiom 1: A description is made using a language.
Axiom 2: A description is not infinitely long.
A correct non-mathematical description of a natural process using a language. Since that natural process is express as with a language, it is possible to build an interpreter for that a finite set of that language. Since an interpreter is realized-by and realized computations, according to the Church-Turing thesis an equivalent lambda calculus problem exists. Therefore, if the Church-Turing lambda-reductibility thesis hold true, every language based description must have at least one equivalent mathematical problems. I concede that this description is probably useless and really hard to build but it exist nonetheless.
I ordered one from Newark after javaone and I am currently running XBMC on it.
I just looked at the site they are out of stock until nov 26, then they will have 1321 more
Because you want the key to be destroyed in case of eavesdrop. Suppose you swap a 64Gb one time pad with me, what assurance do you have that I did not copy the file to Alice ?
no, the safe way would be to synchronized something like a good atomic clock in person, transmit periodically the the drift and sometime a key or a ping using the low energy hidden in plain sight technique
Thats why drones are so popular nowadays. All the benefits of killing people, without all the personal risk. Its a win-win all round.
Makes sense doesn't it?
It does, way too much for my own taste. That why it should be banned: it does make it too safe to kill...
Well here we give in house MS Office training to those who request it, but we are a University and we give that training as a part of the business administration cursus, so that training only cost us the trainee time.
Some laws are worth less than friend, even shady friends...
ex: Let's assume that a friend confess to me that he raped a girl last weekend, I would denounce him without a hint of hesitation. Now imagine that he confessed that last weekend he was snorting cocaine on some prostitutes ass; I would not call the cops, would you ?
Go read the papers !
Seriously MSFT research publish a lot's of first class CS papers. But sadly theirs most marketable products were Songsmith and F#: a failure and something obscure for alpha geeks.
The summary do not answers the question ask by it's title, it addresses the following question: What are dissonant sounds ? And by the way the title of the cited paper is
The basis of musical consonance as revealed by congenital amusia
Slashdot Mirror
I happen to be a marginal freak that happen to like win8 on my laptop and HTPC. A native VLC version will be great for me.
However I would not installed it on my desktop because 1: I lack a license to do so and 2: I would have to buy start8.
keep on posting like that; seriously, you changed for the best :)
an ex- coward that now cower in fear of Mikaealchristthepet628
That statement was almost true until around 2007-2009 were the processor industry switched from an exponential cpu speed function to a linear or logarithmic one...
Definitions
n : floored integer
s : cpu speed
l : float between 0[ and ]1
p : float between [1 2[
s(n) : speed at month n
The function for Moore's law
s(0) : some number
s(n) : s(n/18)*2
A linear speed function
s(0) : some number
s(n) : l*(n-1)
A logarithmic speed function
s(0) : some number
s(n) : p*(n-1)
That shift is significant, now I.A. researchers must also consider speed and parallelism, they cannot rely on Moore's anymore...
Oracle
I used to hate WebSphere with a passion but learning JACL made me love the poor misunderstood abomination that is WebSphere.
Everything is scriptable, and I mean Everything . I had a bash scripter learn it. And now we have the ability to remotely deploy a full WebSphere installation on an server already running up to 8 other installations, configure it, install the requested applications! All that from a shell based wizard. The actual utilization of the script is about 30 seconds long and it's execution time is about 20 minutes long if you also want to install a couple of applications. The wizard takes care of everything in one pass except evidently the installation of the yet to be generated CSR reply. However, the wizard also takes care of that if you select install received CSR CRT reply's....
HOWEVER, the above message only applies to WebSphere, no an atrocity with a name like WebSphere Lotus Inventory Maximo Enterprise Management EditionIf a product from IBM with a name designed by chtulu himself is under you care, I am sorry for you
You are confusing over abstraction and SAP bad use of languages with Java. I have seen SAP Java, ABAP and even some SAP C, systematically it was suffering from lasagna architecture and insane naming conventions, however that bad style is portable across languages.
I just want for someone to prove the Church-Turing conjecture for the set of all finite programs<->calclus. I specified finite as PM breaks down when dealing with an infinite number of elements into a set and Godel do not applies here as I do not search the truth value of a proposition, only a mapping D->P as I transform the parsing and interpretation of a finite description D to an hypothetical lambda calculus problem P. As long as all descriptions are finite and that the Church-Turing conjecture holds true, my conjecture is safe. Sure, there is no usefulness in that transformation, it's only a device to show that at least one mathematical description must exist.
I wish I could address your remark on Tractatus Logico-Philosophicus but I lack knowledge of that book to address your concerns.
And lastly, the project in Principia Mathematica is, in my humble opinion, not failed but it is incomplete and limited to finite sets.
I would argue that every non-mathematical correct description of nature is transformable into math by involving the Church-Turing lambda-reductibility thesis. Axiom 1: A description is made using a language. Axiom 2: A description is not infinitely long. A correct non-mathematical description of a natural process using a language. Since that natural process is express as with a language, it is possible to build an interpreter for that a finite set of that language. Since an interpreter is realized-by and realized computations, according to the Church-Turing thesis an equivalent lambda calculus problem exists. Therefore, if the Church-Turing lambda-reductibility thesis hold true, every language based description must have at least one equivalent mathematical problems. I concede that this description is probably useless and really hard to build but it exist nonetheless.
have a look at that : http://www.rfid-radar.com/howworks.html
I ordered one from Newark after javaone and I am currently running XBMC on it. I just looked at the site they are out of stock until nov 26, then they will have 1321 more
Because you want the key to be destroyed in case of eavesdrop. Suppose you swap a 64Gb one time pad with me, what assurance do you have that I did not copy the file to Alice ?
no, the safe way would be to synchronized something like a good atomic clock in person, transmit periodically the the drift and sometime a key or a ping using the low energy hidden in plain sight technique
the sound subsystem fragmentation is what keeping Linux from being an obvious target for game publisher.
Thats why drones are so popular nowadays. All the benefits of killing people, without all the personal risk. Its a win-win all round. Makes sense doesn't it?
It does, way too much for my own taste. That why it should be banned: it does make it too safe to kill...
every game encryption key is xor with an game specific OTP, they need that gig to hold the pad :P
Oh, and I forgot to tell you that is was all a big prank.
You are way wrong, read on the dadaist, the modern art movement was seeded by theirs manifesto. No need to involve racial conspiracy.
Randomness, big numbers and low probabilities transform mystical events into rare events. No need to involved supranatural source for life's gifts
Well here we give in house MS Office training to those who request it, but we are a University and we give that training as a part of the business administration cursus, so that training only cost us the trainee time.
Some laws are worth less than friend, even shady friends...
ex: Let's assume that a friend confess to me that he raped a girl last weekend, I would denounce him without a hint of hesitation. Now imagine that he confessed that last weekend he was snorting cocaine on some prostitutes ass; I would not call the cops, would you ?
Go read the papers !
Seriously MSFT research publish a lot's of first class CS papers. But sadly theirs most marketable products were Songsmith and F#: a failure and something obscure for alpha geeks.
And by the way the title of the cited paper is
The basis of musical consonance as revealed by congenital amusia
.
thank you both , now I know why !
I think that the correct meme is MDPV is as worst as smoked meth, news at 11
I should not write and drink scotch ! Sorry for the missing words in the above reply, I deeply apologize but sadly I will not learn from that mistake.