Subscribe
The Quantum Pontiffs
Pontifex Praeteritorum
Quantum Announcements
Recent Comments
Category Archives: Words
Hardness of NP
In computer science, NP-hard problems are widely believed to be intractable, not because they have been proved so, but on the empirical evidence of no one having found a fast algorithm for any of them in over half a century … Continue reading
Posted in General, Nitpicker's Paradiso, Words
1 Comment
Science Fiction Prototyping
Posted in Neologista, Off The Deep End, Read You Tweed, Science, Storytime, Technology
21 Comments