Tag: complexity class
-
A further suggestion that P!=NP
There are a class of mathematical problems known as “P”: these can be solved in “polynomial time” or, to cut to the chase, they are problems for which we know how (algorithmically) to solve when we see them. A trivial example is -if you are given a number X, how do you calculate Y which…
-
“Basically, you would be able to compute anything you wanted”
The quote that forms the title here comes from Lance Fortnow, a computer scientist at Northwestern University, in an article (here – subscription required) in the current edition of the New Scientist on the question. It’s an odd statement for a computer scientist to make – most numbers are transcendental numbers and so are fundamentally incomputable:…
cartesian product ... stuff about computing mostly 