Writing

Choose

Tech Tuesday: P = NP?

Last Tech Tuesday, we looked at complexity classes which group problems by their intrinsic difficult. There we encountered one of the great unsolved questions of Computer Science. Is P = NP? The class P is easy to define. It is [...]  Read more

Angel Investing

Later this morning I am participating in a panel called “Angel Investing in Action” at the 2014 Pipeline Fellowship Conference here in NY. The goal of the Pipeline Fellowship is to have more women angel investors (currently only about 1 [...]  Read more

Jury Duty (Follow Up)

I posted yesterday in Homeschool Wednesday about my first time at jury duty. Here is a quick follow up. It turns out I wasn’t chosen for either of the two trials that were under consideration and surprisingly wasn’t asked to [...]  Read more

Tech Tuesday: Complexity Classes

The last few weeks in Tech Tuesday we have looked at various aspects of computational complexity. So far whenever we have looked at a sample problem, such as finding words on a web page, we have studied the characteristics of [...]  Read more