"There are some things in computing that are undecidable."
(Edited)
A fascinating look at how to group different kinds of answers we can get from computing. Brailsford mused about how this particular example took an order of magnitude longer on the previous generation of computers compared to recently.
He also mentions exponential (n^2) and super-exponential problems (n^2 n times (?) I don't even know how to express that).
Source of shared Link
0
0
0.000
Hi, @inertia!
You just got a 0.83% upvote from SteemPlus!
To get higher upvotes, earn more SteemPlus Points (SPP). On your Steemit wallet, check your SPP balance and click on "How to earn SPP?" to find out all the ways to earn.
If you're not using SteemPlus yet, please check our last posts in here to see the many ways in which SteemPlus can improve your Steem experience on Steemit and Busy.