this is related to another recent question but will not ref it directly just to wipe the slate clean. a boolean circuit in TCS is basically a DAG consisting of And, Or, Not gates, and by what is known is "functional completeness" they can compute all possible functions. eg this is the basic pri...

We've been in beta for 1129 days. Don't you think it's time we get out? We seem to be in a similar situation as Code Review. We don't have enough users with sufficient reputation to gain privileges like voting to close and delete. Here's some quick analysis I did with the API (the percentages a...

I found a more efficient sort algorithm with average and best performance of O(N), and worst performance of O(N Log(N)). On random data. I need your help to tell me if my tests is correct, and my biggest question is: How can I test it on real world data? This question going to have five parts: ...

I am interested in the situation where you have a very interesting result. For instance, you have solved a very important open problem. However, you are not known in the field and do not have any remarkable publications. Your supervisor thinks the work is good and you submit the work to a high pr...