13:47
@user777 I think you are slightly misinterpreting the answer. It's not that models of "analog" computation cannot scale, but that the physical processes which implement these models (or rather, the physical theory of those processes) "cannot scale", in the sense that there is a known physical constant that provides an upper bound on the size of any computation that this physical process can perform.
Because this upper bound C, any Turing machine can simulate the analog computer in O(f(C)) for some function C, which is why the answer concludes analog computation models are unlikely to provide a counterexample to the ECT.
Also, yes, this place is very quiet. Has been that way since before I joined the site, unfortunately. I do try to pop in regularly (ok, apart from the last ~4 months, but that was exceptional), so feel free to ask/comment/whatever, and someone (e.g. me) will probably reply within at most a week or so.
@NikeDattani So, I might as well answer your question. I apologize for the delay. As I said above, this room has had similar activity since before I joined this site, so I cannot give an accurate historical answer.
However, I can still speculate. I think the main reason is that the number of users that 1) are regulars on CS.SE, and 2) are interested in informal chit-chat on SE, and 3) were not already active in chat elsewhere on SE (mainly thinking SO or Math.SE) before joining CS.SE ; is simply too small to maintain regular conversations.
7 hours later…
20:52
4

I'm trying the following question from my homework:
We're given a graph $G$ and parameters $k,\hat{P}, \hat{W}\in \mathbb{N}$. Additionally, each $v \in V(G)$ has a profit and weight: $p_v, w_v\in \mathbb{N}$.
Suppose you're given an $2^k \cdot n^{O(1)}$-time algorithm $\mathcal{A}$ which finds w...
« first day (3420 days earlier) ← previous day next day → last day (1315 days later) »