Theory
in [Programming]
|
Data Flow languages and programming - Part I SHOULD IT BE TURTLES ALL THE WAY UP? In the famous anecdote, the little old lady replies to the noted philosopher, "It's turtles all the way down." When it comes to writing software many writers on software design and many programming language creators seem to believe that it is turtles all the way up. ... 5 Nov 2009 13:22
simple: P versus NP <span onmouseover="_tipon(this)" onmouseout="_tipoff()"><span class="google-src-text" style="direction: ltr; text-align: left">Das '''P-NP-Problem''' (auch '''P≟NP''', '''P versus NP''') ist ein ungelöstes Problem der [[Mathematik]] und [[theoretische Informatik| theoretischen Informatik]], speziell der [[K... 24 Oct 2009 14:19
The real deal: Proof of Cook's Theorem in Unary - Thank you Sci.Math for your patience and kindness MACHINE PROOFED RESOLUTION TO THE P VERSUS NP PROBLEM PRESENTED BY M. MICHAEL MUSATOV WITH A PROMISE TO DONATE ALL $1MM DOLLARS OF THE CLAY PRIZE TO CURE CHILDHOOD CANCER WITH HTTP://WWW.ALEXSLEMONADE.ORG/ THE P VERSUS NP PROBLEM TWO POSSIBILITIES: 1 OR 2 CHOOSE [P =/=NP] AND [P == NP] OR [P =/=NP... 22 Oct 2009 21:57
Proof of Cook's Theorem in Unary On Oct 22, 4:48 pm, Tegiri Nenashi <tegirinena...(a)gmail.com> wrote: On Oct 21, 5:04 pm, cplxphil <cplxp...(a)gmail.com> wrote: I'm not sure if you're disagreeing. If you are, my response is that you could argue that it preserves the same structure of the decision problem, but expressed as a formal l... 22 Oct 2009 21:56
[Port%d] \\.\HCD%d nProtectGameMon dwAddrAspr2: %x %x skip 1 byte(%x) dwAddrAspr4: dwMem:%x, aspr4:%x, crc:%x 68: %x %x (%x): %x %x %x %x %x %x %x %x %x skip 1 byte(%x) not skip 1 byte(%x) dwAddrAspr3: dwMem:%x, aspr3:%x, crc:%x e9: %x %x (%x): %x %x %x %x %x %x %x %x %x poly start %x skip 1 btye(0004) Thread32Next Thread32Fi... 21 Oct 2009 08:11
an oracle paradox Hi all, I recently formulated the following paradox relating to oracles and oracle machines. Comments on how to resolve it would be appreciated (I am still puzzled). Consider the class of all "describable languages." This is defined as the set of all languages whose behavior can be described in logical or ... 22 Oct 2009 01:59
Theorem 4.6. The class of box perfect graphs is in co-NP. Proof. Suppose that G is not a box perfect graph. Since the class of perfect graphs is in co-NP, if G is not perfect then there exists a polynomial-time proof of this, which also proves that G is not box perfect. Suppose that G is perfect. By the results of Gr~tschel, Lov~sz, and Schrijver [24, 25], one can optim... 19 Oct 2009 23:05
Proposed quantum algorithm for inverting one-way permutations I would like to modify a framework for structured quantum search first suggested by Kastella-Freeling (preprint quant-ph/0109087), perhaps correcting a flaw in their approach. The algorithm inverts one-way permutations in apparent poly-time (and, with modification, some other one-way functions). Since this... 19 Oct 2009 04:14
Difference between an array, list, vector, and a tuple. I'm trying to understand what is really meant by these words in computer science. It seems like lots of programming language have different definitions of what these are (read: an array in C is not the same as an array in Ruby). The reason I ask this question is because I was designing my own programming languag... 16 Oct 2009 07:29 |