Hacker Newsnew | past | comments | ask | show | jobs | submit | mockerell's commentslogin

Good observation and I agree that the German situation is more nuanced, even if it’s not perceived as such.

GP’s argument applies to the design of German state bureaucracy. E.g there exist no unified German identification number but several for different purposes (tax, pension etc.). This is directly motivated from the Nazi regime as GP told us. That’s also why the Stasi is not often cited as an argument because the GDR developed in parallel with the West German state.

I would say that these precautions are not enough to prevent a 21st century authoritarian regime from rising and using data. Most of the interesting data is in the hand of privatized public places (social media). We can see these issues already happening with ICE in the US


Venture capitalists and Silicon Valley have strong anti-intellectual tendencies as a whole. See how many founders pride themselves of being drop-outs and how many of them openly reject humanism and liberal arts. HN is mainly a plattform of Ycombinator to advertise and find like-minded workforce.


I hope you're not suggesting that I am anti-intellectual.


A personal favorite of mine is fixed-parameter tractability. Instead of analysing the worst case running time solely on the input length we introduce a *parameter* and study the time complexity in both. Intuitively, the parameter „should“ be small and is often chosen to be the solution size or some specific measure of the input.

Consider the vertex cover problem where you want to cover all edges of a graph by at most k vertices (that are incident to all edges). It is a classical NP-complete problem and the naive bruteforce solver needs something like n^k time. Which is already huge for small k, say, 10.

A very simple fixed-parameter tractable (fpt) algorithm for this problem achieves a worst case time of 2^k * n. For huge graphs and small k (again, let’s say 10) this is a massive improvement.

This is a very active field, where we have a good understanding which problems allow have such a worst case time and which not (under some complexity theoretic assumptions of course). It incorporates also the idea of restricting the input to only specific „simple“ instances gradually. This happens if you add graph measures as a parameter.

Many NP-hard graph problems are in P if restricted to planar graphs. But what if the instances are „almost“ planar? If you choose a parameter that measures the structure of a graph such that the measure is low if the graph is planar and high if it isn’t, any fpt algorithm for this parameterization works on any graph; fast if it is planar, and fast-ish if it is close to being planar.

Of course, this is theory with the similar metaphysical caveats classical complexity theorem has. However, it results in interesting algorithmcsl tools and interacts nicely with specific fields of structural graph theory.


It is indeed very interesting. For the latter the concepts from fine-grained complexity and average time are interesting. For specific problems, there are theoretical fine grained lower bounds for time complexity (i.e. cannot be solved in (truly) subcubic time). However, these rely on assumptions that are even stronger than P != NP.


You’re right, it doesn’t. However, in TSP you are allowed to visit each vertex *exactly* once. So traversing the minimum spanning tree naively is not a valid solution. What you the approximation does is to „shortcut“ the paths if you would revisit an already seen vertex again. That’s where you need the triangle inequality to guarantee that the shortcut isn’t longer than the path through the minimum spanning tree. Otherwise you cannot guarantee an approximation ratio of at most 2.


So we see that a slight modification of the problem makes the approximation work for all graphs.


Elaborate on the proposed modification — are you referring to the fact that this can be done if distances obey a metric function?


If you modify the problem to allow passing by a node that you've already visited then the spanning tree approximation works for all graphs.


That’s an interesting way to think about it. While tests don’t satisfy mathematicians‘ standards for rigor one could instead look at interactive proofs from complexity theory. These are of interest if a problem doesn’t allow for short proofs, i.e. when the problem is not in NP [1]. In your scenario an adapted AI-assisted theorem prover would be the prover, and a mathematician the verifier.

[1] https://en.wikipedia.org/wiki/Interactive_proof_system


Thank you for explaining my point more logically and coherently. I'll read it over.


Look no further! SailGP is pretty much the maritime version of F1


I just wanted to tell you that I wholeheartedly agree with your statement and that you shouldn’t be discouraged by some of the nay-sayers in the replies. I feel that HN has many users who are techno-optimist, but are very pessimistic of the role of individuals and the possibilities of the society overall.

Even in the replies someone tries to appeal to some ideal of „rationalism“ which is nothing but defeatism to the status quo. They see any kind of passion, emotion or values as „irrational“ and categorically as something lesser.

But what is reason without values? Logic without axioms? Just treading in the trivial waters.


The lack of actual photos of Labubus "in the real" (usually on a keychain at a pant's belt loops) is jarring. The topic of the "performative male" has been regurgitated in social media for quite some time. Still the author ignores that and misses the overall bigger picture.

I think any argument made here with regard to Baudrillard's hyperreality could be made about most trends, not only Labubus. Actual insight into the demographic is missing.

I prefer the following video which touches on the performative male (it's in German though). Don't get distracted by the title, it's nuanced and offered me some insight into performative behaviors (both the recent manifestation and in general) https://www.youtube.com/watch?v=4rFMdKcR824


Hyperreality is a bogus concept altogether, inasmuch as it's supposed to be something new in human history that only happens because of computers. Prehistoric/ancient humans also had fashion trends and myths and symbols and deep context


computing merely spurred the conceptualization of hyperreality. the original impetus was more along the lines of societal imagery like media, wax museums, or theme parks (as mentioned in the article). computing is not seen in the seminal definition of a map overflowing its territory. this definition does align with integer overflow/underflow but isn't predicated upon the existence of those concepts. therefore the concept of hyperreality may be embodied in many contexts, both prior to and post the advent of computing.


How does it fit into this xkcd?

https://xkcd.com/977/


Too new to be on that one: https://en.wikipedia.org/wiki/Equal_Earth_projection

Reason for being seems to be more or less "square accurate-area maps are ugly".


Like Robinson, but more so.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: