All of mcallisterjp's Comments + Replies

In type theory and some fields of logic, 2 is usually defined as (λf.λx.f (f x)); essentially, the concept of doing something twice.

That's the number of all directed graphs, some of which certainly have cycles.

7Richard_Kennaway
So it is. 3^(n choose 2) >> n^n stands though. A lower bound for the number of DAGs can be found by observing that if we drop the directedness of the edges, there are 2^(n choose 2) undirected graphs on a set of n distinguishable vertices, and each of these corresponds to at least 1 DAG. Therefore there are at least that many DAGs, and 2^(n choose 2) is also much larger than n.

Surveyed. Looking forward to the data and analysis, as per every year.

That's not how Big O notation works: O(100,000) = O(1).

You presumably mean "in the order of 100,000", which is sometimes written "~100,000".

0[anonymous]
Yes, I'm quoting it for its elegance and appearance in popular culture, not because it's a new idea. See first sentence.