/sci/ - Science & Math

Anonymous Fri May 10 22:44:39 2013 No.5749460 [View]
File: 42 KB, 1000x1402, Polynomial_time_hierarchy.png [View same] [iqdb] [saucenao] [google]

>>5749430
HAHAHAHAHAHAHAHA, no.

Proofs are infinitely harder than the hardest problems in the kiddy pool of CS. If you had a Turing machine with a halting problem solving oracle, you still couldn't decide a proof of any arbitrary mathematical statement. In fact any the finite progression of Turing Machines_n with oracle that solves the halting problem for Turing Machines_n-1 (0 being regular TM) can't decide proofs.

Mathematicians do the work of gods, Computer scientist just do the work of monkeys.

Advanced search
Text to find
Subject [?]Search by post subject. Leave empty for any.
Username [?]Search for user name. Leave empty for any user name.
Tripcode [?]Search for tripcode. Leave empty for any.
Email [?]Search by email. Leave empty for any.
Filename [?]Search by image filename. Leave empty for any.
From Date [?]Enter what date to start searching from. Format is YYYY-MM-DD
To Date [?]Enter what date to start searching until. Format is YYYY-MM-DD
Image hash
Search in	All Posts OPs Only
Deleted posts	Show all posts Show only deleted posts Only show non-deleted posts
Internal posts	Show all posts Show only internal posts Show only archived posts
Order	New posts first Old posts first
Capcode	All Posts Only by Users Only by Mods Only by Admins Only by Developers
Results	Posts Threads
Action	[ Simple ]

Navigation
View posts	[+24]	[+48]	[+96]

/sci/ - Science & Math

Search: