Skip to main content
5 events
when toggle format what by license comment
Jul 2, 2014 at 6:15 comment added InformedA I think I need to make an example with the conjecture remark. So let's say this: your program has a set of integers, and a target integer. It has a branching statement that is if a set of input numbers is a subset the program's set and sum to the target integer, then you do A, else you do B. With the current knowledge in computer science, this program is NP-complete, so in order to generate a test case so that you go into branch A, you would need exponential amount of resources to generate a test case. This is enough to say, it's not feasible from theoretical as well as practical stand point.
Jul 1, 2014 at 12:52 comment added Adam Zuckerman You say that it is not feasible "speaking with current theoretical knowledge in computer science". What does that mean? Do you have any supporting documentation for your statement?
S Jul 1, 2014 at 12:23 review Late answers
Jul 1, 2014 at 12:26
S Jul 1, 2014 at 12:23 review First posts
Jul 1, 2014 at 12:52
Jul 1, 2014 at 12:04 history answered randomA CC BY-SA 3.0