P=NP, Musatov129, Real "Minus" Time, P=NP Algorithm

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
2,352
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Feb 13, 2009

An algorithm is shown to operate in withstanding halting problems, against a binary P=NP absolute value.

  • likes, 4 dislikes

Link to this comment:

Share to:

Uploader Comments (martymusatov)

  • Have you cracked a 128-bit cryptographic code yet?

  • @telsys Yes. I PM'ed you the algorithm.

  • Encrypts (or decrypts) the specified text string. Enter with: txt -- the text string to be encrypted (or decrypted) mode -- +1=encrypt, -1=decrypt Returns the encrypted (or decrypted) text string Text coder (Int mode, Text txt)

  • s = "" Do k = 0, length(txt)-1 ch=ascii(extract(txt,k,k)) If (ch>47 And ch<58) ch=48+cycle(ch+mode*random(10)­-48,10)

  • If (ch>64 And ch<91) 

  • @martymusatov ch=65+cycle(ch+mode*random(26)­-65,26) If (ch>96 And ch<123) ch=97+cycle(ch+mode*random(26)­-97,26) s = s + char(ch) Loop k Return s

Video Responses

This video is a response to CERN: [Clear Visual Proof: P!==NP]
see all

All Comments (9)

Sign In or Sign Up now to post a comment!
  • :-)

  • Might be too complex for you to understand. Pure Theory of Computation.

  • what going on here?

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more