Author Topic: The Most Difficult Program to Compute?!  (Read 526 times)

0 Members and 1 Guest are viewing this topic.

Offline sakthibruce

  • Knight
  • **
  • Posts: 289
  • Cookies: 52
    • View Profile
The Most Difficult Program to Compute?!
« on: July 02, 2014, 09:58:43 am »

https://www.youtube.com/watch?v=i7sm9dzFtEI

The story of recursion continues as Professor Brailsford explains one of the most difficult programs to compute: Ackermann's function.
Say, "I can do everything." "Even if poison of a snake is powerless if you can firmly deny it."

Offline bluechill

  • Cybermancer
  • Royal Highness
  • ****
  • Posts: 682
  • Cookies: 344
  • I am the existence in these walls
    • View Profile
Re: The Most Difficult Program to Compute?!
« Reply #1 on: July 02, 2014, 04:05:32 pm »
NP hard problems /thread
I have dreamed a dream, but now that dream has gone from me.  In its place now exists my own reality, a reality which I have created for myself by myself.

Offline Architect

  • Sir
  • ***
  • Posts: 428
  • Cookies: 56
  • STFU
    • View Profile
    • Rootd IRC
Re: The Most Difficult Program to Compute?!
« Reply #2 on: July 02, 2014, 04:41:09 pm »
NP hard problems /thread

Dafuq chillz, you shouldn't end there, at least explain what NP=P means so the noobs know why and shit.

Offline Heisenburg

  • Serf
  • *
  • Posts: 32
  • Cookies: 4
    • View Profile
Re: The Most Difficult Program to Compute?!
« Reply #3 on: July 02, 2014, 05:22:52 pm »
 ::) Random number generation. Perhaps, unless using hardware support

Offline Deque

  • P.I.N.N.
  • Global Moderator
  • Overlord
  • *
  • Posts: 1203
  • Cookies: 518
  • Programmer, Malware Analyst
    • View Profile
Re: The Most Difficult Program to Compute?!
« Reply #4 on: July 03, 2014, 08:21:45 am »
Or let's be more specific and let's say EXPSPACE problems.