Prev: Bell Inequality is the Double Slit experiment performed on the Cosmos rather than microworld #550 Correcting Math
Next: Notation: direct product of values of functions
From: What you are reading is Philosophy and P Versus NP. on 30 Mar 2010 16:39
C++|c++|CC:\
:pb=\p\d?\(:cf:np=\)\d?;:bb={:be=}:\
:cb=/*:ce=*/:ab=//:ae=$:sb=":se=\e":lb=':\
:zb=@:ze=@:tb=%%:te=%%:mb=%\$:me=\$%:vb=%\|:ve=\|%:\
:le=\e':tl:id=_~\::\
:kw=asm auto break case cdecl char continue default do double else
\
enum extern far float for fortran goto huge if int interrupt long\
near pascal register return short signed sizeof static struct\
switch typedef union unsigned while void\
#define #else #endif #if #ifdef #ifndef #include #undef # define\
endif ifdef ifndef include undef defined #pragma\
class const delete friend inline new operator overload private\
protected public template this virtual:
From: porky_pig_jr on 30 Mar 2010 19:45
On Mar 30, 4:39 pm, "What you are reading is Philosophy and P Versus
NP." <marty.musa...(a)gmail.com> wrote:
>  C++|c++|CC:\
>     :pb=\p\d?\(:cf:np=\)\d?;:bb={:be=}:\
>     :cb=/*:ce=*/:ab=//:ae=$:sb=":se=\e":lb=':\
>     :zb=@:ze=@:tb=%%:te=%%:mb=%\$:me=\$%:vb=%\|:ve=\|%:\
>     :le=\e':tl:id=_~\::\
>     :kw=asm auto break case cdecl char continue default do double else
> \
>     enum extern far float for fortran goto huge if int interrupt long\
>     near pascal register return short signed sizeof static struct\
>     switch typedef union unsigned while void\
>     #define #else #endif #if #ifdef #ifndef #include #undef # define\
>     endif ifdef ifndef include undef defined #pragma\
>     class const delete friend inline new operator overload private\
>     protected public template this virtual:

stinks like Musatov.
From: R Swipe on 30 Mar 2010 20:23
Typical Google-poster idiocy.

Typical gmail.com address idiocy.

"What you are reading is Philosophy and P Versus NP."
<marty.musatov(a)gmail.com> wrote in message
news:1ea34b55-3dee-4749-bd93-19e58cf492f2(a)j21g2000yqh.googlegroups.com...

Typical musatov idiocy.



From: marty.musatov on 30 Mar 2010 18:30
> Typical Google-poster idiocy.
Keep it to yourself please.
>
> Typical gmail.com address idiocy.
Keep it to yourself please.
>
> "What you are reading is Philosophy and P Versus NP."
>
> <marty.musatov(a)gmail.com> wrote in message
> news:1ea34b55-3dee-4749-bd93-19e58cf492f2(a)j21g2000yqh.
> googlegroups.com...
>
> Typical musatov idiocy.
Keep it to yourself please.
>
>
>
1. Begin with N elements and a probability p of change in each element.
2. The probability each element will not change is 1-p.
3. N x p elements will change in copying elements.
4. N x (1 - p) elements will not change in copying elements.

Example:

1. 10 with a 10% probability of each element being changed.
2. The probability each element will not change is 1 - .1
3. 10 * .1 = 1 element will be changed in copying elements.
4. 10 x (1 - .1) = 9 elements will not change in copying elements.

A book is being printed for the first time. The book has 10 chapters.

If there is a 10% chance a chapter of the book will change before the
second printing, then we may state before the second printing:

One chapter of the second edition of the book differs from the first.
Nine chapters of the second edition of the book are the same as the first.


by changing those things which need to be changed

Coram nobis

begin
/* The following for-loop is the guessing stage*/
for i=1 to N do
X[i] := choose(i);
endfor


/* Next is the verification stage */
Write code that does not use "choose" and that
verifies if X[1:N] is a correct solution to the
problem.
end

Example of an NP problem: The Hamiltonian Cycle (HC) problem
Input: A graph G
Question: Does G have a Hamiltonian Cycle?

Here is an NP algorithm for the HC problem:

begin
/* The following for-loop is the guessing stage*/
for i=1 to n do
X[i] := choose(i);
endfor


/* Next is the verification stage */
for i=1 to n do
for j=i+1 to n do
if X[i] = X[j] then
return(no);
endif
endfor
endfor
for i=1 to n-1 do
if (X[i],X[i+1]) is not an edge then
return(no);
endif
endfor
if (X[n],X[1]) is not an edge then
return(no);
endif

return(yes);
end
 | 
Pages: 1
Prev: Bell Inequality is the Double Slit experiment performed on the Cosmos rather than microworld #550 Correcting Math
Next: Notation: direct product of values of functions