Computer Forums - View Single Post

TheHeadFL · 07-14-2005, 06:43 PM

No I've never heard of busy beaver functions.. I'll have to look into them. Most of this stuff I learned during my various Discrete Mathematics courses here at UCF. I enjoyed the class about turing machines and noncomputability immensely. I think I will be taking a class in encryption soon.

KornNut- Yes, I have read Digital Fortress by Dan Brown, good book. Its interesting that you mention NP completeness, since that is also really interesting. If they could prove that prime number factorization was a problem that was in P, then thousands of other problems associated with it would be in P as well. Just imagine if they could prove the halting problem was in P!

07-14-2005, 06:43 PM	#9 (permalink)
TheHeadFL Ultra Techie Join Date: Jul 2005 Posts: 530	No I've never heard of busy beaver functions.. I'll have to look into them. Most of this stuff I learned during my various Discrete Mathematics courses here at UCF. I enjoyed the class about turing machines and noncomputability immensely. I think I will be taking a class in encryption soon. KornNut- Yes, I have read Digital Fortress by Dan Brown, good book. Its interesting that you mention NP completeness, since that is also really interesting. If they could prove that prime number factorization was a problem that was in P, then thousands of other problems associated with it would be in P as well. Just imagine if they could prove the halting problem was in P! __________________ Desktop machine: 2 x Opteron 246, Asus K8N-DL, 2GB PC3200 ECC Reg., XFX GeForce 6600GT, 74gb WD Raptor, 2 x 19\" LCDs, Windows XP x64 Server machine: Intel P4 3.0GHz 2MB EM64T, ECS i865pe, 1GB PC3200, 36gb WD Raptor, Windows Server 2003 Laptop: Dell Inspiron 9100 (Intel P4 3.2GHz 1MB Prescott, i865pe, 512MB PC3200, Mobility Radeon 9700, DVD+R/DL Burner), Windows XP Linux: P3 450Mhz, 386MB ram, Slackware 10.1 (Running mySQL/Apache)