Ar-Curunir

9 ms·

1.
by Ar-Curunir 7d ago
Oh yeah, the real world has subtitles, right?
2.
by Ar-Curunir 7d ago
What? Plenty of people can use the smaller iPhones with just one hand.
3.
by Ar-Curunir 8d ago
You can indeed generate many nonsensical problems. Generating ones which require interesting and non-trivial mathematics is much more difficult.
4.
by Ar-Curunir 8d ago
Current career structure of mathematicians works partially by looking at whether they have solved novel and interesting problems, or at least done theory-building that can help solve such problems. Many mathematicians are also motivated by
5.
by Ar-Curunir 8d ago
Have you heard of, e.g., Walmart? How do you think their logistics works? Or, similarly, any modern capitalist economy? Do you think it's entirely decentralized planning with independent actors?
6.
by Ar-Curunir 9d ago
"Capitalist central planning is actually communism". If you're going to use wrong words, then be prepared for people to be pissed off at your wrong usage.
7.
by Ar-Curunir 9d ago
They offered to collaborate by asking to drop a coauthor. That is not collaboration, and is not an academic norm.
8.
by Ar-Curunir 9d ago
> And simply knowing a problem can be solved is half the battle. Have you done any mathematical research? If not, then no, knowing that a problem is solvable is not “half the battle”. Homework problems are all designed to be solvable, ye
9.
by Ar-Curunir 9d ago
To come away from this thinking that the academic is the bad actor, given OpenAI’s reputation, is certainly an exercise in creative thinking.
10.
by Ar-Curunir 9d ago
Dude you’re over this entire thread unflinchingly supporting OpenAI with nonsense semantics-based arguments. Either put up some evidence-backed arguments, or shut up.
11.
by Ar-Curunir 10d ago
They definitely do, just implicitly. In the past it was more explicitly stated.
12.
by Ar-Curunir 20d ago
This entire thread you’ve been talking about the PKK with very little evidence in support.
13.
by Ar-Curunir 20d ago
Morality != legality. these anarchists have a much better moral grounding than most US tech companies which gladly support US military destruction.
14.
by Ar-Curunir 21d ago
Yet on most metrics IBM is a success.
15.
by Ar-Curunir 27d ago
I don’t think that’s true. True masters will create works that enable additional interpretations, perhaps beyond or even contradictory to those intended by the original authors. I doubt 50 Shades of Grey enables such a multitude of addition
16.
by Ar-Curunir 1mo ago
Man even your comments sound like they’re written by an LLM
17.
by Ar-Curunir 1mo ago
Yes, they just hand out Turing Awards for bullshit.
18.
by Ar-Curunir 1mo ago
What is your envisaged application? ZKPs give you integrity guarantees which prevent malicious behaviour.
19.
by Ar-Curunir 1mo ago
Shipping from Asia to Asia doesn’t make much sense
20.
by Ar-Curunir 1mo ago
No, that’s not what proper encryption means. Security for encryption means that cipher texts encrypting distinct messages are indistinguishable. This is called IND-CPA, and FHE satisfies this.
21.
by Ar-Curunir 1mo ago
The article brings with an incorrect premise, and then argues a different point. The opening premise is: NP-hardness is easy in theory, hard in practice, the point made is that it’s easy in practice. But that premise is itself wrong: comple
22.
by Ar-Curunir 1mo ago
You have clearly not encountered theoretical computer scientists. They love to create all kinds of complexity classes and theorems to capture things like heuristics and approximation algorithms and other things which work in practice but no
23.
by Ar-Curunir 1mo ago
There is research as of last year which brings unoptimised impls of those join algorithms to “on-par” with optimized non-optimal industry impls. There’s still research to be done in optimizing these algorithms in both theory and practice.
24.
by Ar-Curunir 1mo ago
What do you mean? There’s plenty of high impact research on databases happening in academia. (Including, for example, Andy’s group at CMU) Also keep in mind that the part you quoted is partially marketing copy.
25.
by Ar-Curunir 1mo ago
Circuit complexity lower bounds (and lower bounds in general) are notoriously difficult to come across. For example, despite our best efforts, the state of the art lower bounds on time complexity of algorithms for solving 3SAT is O(n). In c
26.
by Ar-Curunir 2mo ago
Do you have any evidence that the bugs were due to LLM code? Or are you just speculating baselessly
27.
by Ar-Curunir 2mo ago
Shevy is a long time troll. Should have been banned a while back
28.
by Ar-Curunir 2mo ago
What does one have to do with the other?
29.
by Ar-Curunir 2mo ago
The problems from CS (CVP and circuit complexity) are very important problems that have been worked on by top researchers for 30-40 years. Some of these researchers include Turing Award winners. A solution to them would be a best-paper awar
30.
by Ar-Curunir 2mo ago
Some of the problems solved here, at least in CS, have been open for decades, and have been worked on by very smart leading researchers in the field, including Turing Award winners. Like, these would be best-paper awards at many top CS conf

More ›