- Hello, TCS assistant professor here: he is legitimately respected among his peers.
Of course, because I am a selfish person, I'd say I appreciate most his work on convex body chasing (see "Competitively chasing convex bodies" on the Wikipedia link), because it follows up on some of my work.
Objectively, you should check his conference submission record, it will be a huge number of A*/A CORE rank conferences, which means the best possible in TCS. Or the prizes section on Wikipedia.
- > Realistically there's no reason government can't use open source software and open formats especially.
> Last time I had to fill out a government form in Canada (...)
Without any evidence, let me argue why maybe it shouldn't. In the past, a common opinion that I have heard is that open source is more secure because all the code is out in the open.
The recent xzutils backdoor attempt [1] kind of led me to believe it's not really true, it's only true if many good-actor eyeballs, which are willing to donate their time for public benefit, are on the code.
Almost all of the government's code that I interact with are web apps that are potential targets of foreign adversaries -- tax filing web apps, prescription + vaccination scheduling web apps, family benefit applications, and more. (This is not in Czechia, but close.)
Now, would I want to read that web app code? Not at all, I couldn't care less about it. However, foreign adversaries would love to immediately start analyzing it. Extracting the entire country's health data or tax data would be a goldmine.
And even though there probably are several people actively paid to maintain security of these systems, I feel that the foreign adversarial agents would be much more motivated (and better paid) than government employees/software developers.
You could make a opt-out for national-security purposes for the code, but I feel almost all the code a government works on would have such an impact when compromised.
[1]: https://en.wikipedia.org/wiki/XZ_Utils_backdoor
(Disclaimer: I am a huge supporter of open source in general, contributed to the Linux ecosystem in the past and in my current job as an academic, almost everything I do is available out in the open in some way or another.)
- > I've worked in academia - and yes, that has been in multiple countries in the EU - I've never had to utter a single word in something other than English in the workplace.
I have the same trajectory as you -- multiple countries in the EU, working in academia -- but different experiences for sure. Or at least a mixed bag.
Let me list them in order of how much English sufficed:
1. The Netherlands -- common knowledge is that their English is top notch and anecdotally it was the case as well, I also got by purely with English.
2. Germany -- their English is also good but I needed German in edge cases. One edge case was finding an apartment (not speaking German simply pushed you down the list of candidates, even with a full time job in academia). Another one were university rules and announcements; not every email was in English, but arguably easy to get by with modern translation tools.
3. Czechia & Poland -- English is good among the professors but the percentage of locals at the university level is so high that most internal meetings, announcements, local seminars take place in the local language. In my experience, non-faculty university staff (department secretaries, payroll, entrance security) usually strongly dislike speaking English or outright do not speak it at all.
---
I've omitted some more cases where local languages are required. If you live in a country, you will eventually interact with the healthcare sector, where the language experience will likely mimic the experience at the workplace (for the countries above, it would be in the same order for the healthcare sector).
Another case is government bureaucracy. For most of the EU countries I've been to, the official language of the country is their local language and only their local language. This means that government employees are not required to speak any other language other than the official one to you, plus you might be required to fill in forms and communicate in the official language if you want to talk to them.
In my experience, the helpful/good ones may try to communicate with you in English but if you need something from them or if the bureaucrat had a bad day, you better start talking in the official language.
- It reminds me of the fact that the "Fake Mr Beast giveaway" ads that even raised some attention here on Hacker News [1] a while ago are still around. In fact, I have seen one yesterday. Those must have been flagged as impersonation and scam thousands of times by many people, including me personally, and Youtube finds them perfectly fine.
After that episode, where I tried myself to get rid of them, I am much more convinced that Youtube is fine with all but the worst scammers, and don't buy any of the "they're just low on manpower" arguments anymore.
- The author writes about himself:
> Hi! I'm a PhD student studying computer science at Rice University.
This means that we are on the same career path (I am currently an assistant professor in theoretical CS in Europe). I wish you of course best of luck!
Here is the harshest truth about teaching I learned during my PhD:
If you are focusing on teaching too much, you are setting yourself up for failure.
This sounds cruel, and in fact I am much like you, I love teaching and I love self-improvement and it is quite easy for me to invest time into my teaching prep, presentation, and more and see measurable results in class quality and usually also student feedback.
However, at least in my neck of the woods (i.e. Europe), almost all gates and gatekeepers for you as a PhD student, and later postdoc, are checking your research. At some places they really do expect you to have K publications in the top 3 CS conferences or you will not be considered at all -- and it seems these thresholds are only getting higher. Here I mean for example invitation-only workshops, postdoc positions with top advisors, and later also permanent positions.
On the other hand, if you are a talented scientist, they usually only care that your teaching skills are at the bare minimum -- have you taught something? Yes? Great.
Now orator/presentation skills are critical and presenting a coherent lecture plan might be useful for a final presentation at an interview for a permanent position. But even there, it is more about you knowing what you want to teach and how it complements the department than about your past achievements (i.e., how much you have put in a course previously).
My PhD advisor usually said that he likes to dig into teaching when research is not going well. I agree with that -- teaching really is fulfilling to me and I love to improve my class and see people happy with it, and research is all about global ranking (which is tough on anyone's psyche) and generating progress which is the fun part but sometimes takes a long time. However, at your stage of your career, the research really can't go slow.
---
PS: If the author reads this, since it is a self-post, your class sounds really nice and it is actually one I would have loved to attend. My research is in online algorithms -- a field which you can rephrase as seeing some theoretical problems as two player games between a solver and an adversary -- and among other things I would like to consider utilizing all the techniques of chess solvers (which cannot evaluate the game fully, but "almost") and transfer it to other areas of online algorithms.
- > Isn't the problem de facto solved by matchmaking? The player that aims better will quickly win more and be elevated to the level of opponents on par with them.
Matchmaking decreases the odds you meet a cheater for low rank players, and significantly increases it for higher rank players -- and since there's fewer of them due to the Bell curve, they are going to feel the cheaters that much more.
If you just rely on rank and not on anti-cheat efforts, you'd be just destroying one of the loyal cores of the playerbase, one which is also quite vocal online.
From my personal experience of thousands of hours in competitive FPS shooters on PC, there is no point in ranking where playing against a cheater becomes fair or fun.
- > Too often, grad school applicants are just kids that have overachieved in academic settings and think to themselves “I’ve been good at school my whole life, why not just do school forever?
Anecdotally, I did not observe this during my PhD studies (theorerical CS) in Central Europe. I think this might be due to the separate 3 year Bachelor track, then a 2 year Master track, and only then 4 year PhD studies.
Sure enough, a lot of applicants faced tough career decisions after graduating, but whoever started the PhD usually knew what research is about and that it's going to be work first and foremost, not just "more school".
- Quickly skimming it, I found no evidence of what the future actually held, from Wikipedia [1]:
> In 1981, Pizza Time Theatre went public; they lost $15 million in 1983. By early 1984, Bushnell's debts were insurmountable, resulting in the filing of Chapter 11 bankruptcy for Pizza Time Theatre Inc. on March 28, 1984.
- > FYI its oral exams, not oral presentations.
I was not very clear about it, but I was discussing regular semester work, as opposed to final/midterm exams. Think courses that are strongly grounded in theory but need the students to experience the coursework, like Discrete Mathematics or Linear Programming.
"Oral presentations" in my case meant presenting a homework solution to the TA in person, in front of the class, and the TA accepting this solution live (or not).
At least at my university, the responsibility for homework structure and homework sheets lies fully on the lecturer, and the TAs are tasked with grading the homework/projects and leading the exercise sessions.
Oral exams are great if they can be done at scale, and I do use them. Some other teachers (as well as the administration) prefer written exams, as there is a clear proof of work that can be analyzed if grades are disputed.
- Speaking as an (assistant) professor in theoretical CS, I see there are many bad approaches in the original post and mentioned in this discussion, but I strongly disagree with:
> There are very simple and effective ways to teach your class that can't be cheated with AI. These professors are simply lazy and uncreative.
I can attest to the following problems to good homework creation, from my own experiences playing with ChatGPT and teaching:
1. If you want to give a very illustrative yet easy theoretical exercise in algorithm design, one that computer scientists have solved over and over in the last few decades and which furthers your understanding, there are very likely solutions online and ChatGPT will give you the solution with very high probability.
2. If you create your own dataset and want the students to implement some algorithm and create a simple plot/discussion from the results, it will be very hard to distinguish a "student solved it on their own, but they did not invest too much time into it" submissions from ChatGPT submissions produced by a couple of queries.
3. Switching to oral presentations is hard to scale (as others attest) and also does not resolve much, because some students are perfectly okay with being handed a solution from somewhere (colleague, ChatGPT), not understanding it very well, and yet presenting it. Failing these students likely leads to overly difficult classes.
4. In-classroom exams without a computer work best, but they also do not scale very well (a lot of prep/correction needs to go into them) and some students with bad anxiety management skills, which includes me as a former student, dislike them passionately.
---
As you can see, this topic is quite critical for my profession. The ugly truth is that university professors have only a very limited time allocated in their busy workweeks for teaching, and hence they have to take many shortcuts, including suboptimal homework sheets and limited innovation year-over-year. I also do not allocate as much time for philosophy of teaching/improving teaching skills as I would have liked.
If anyone here has novel ideas how to actually implement "a class that can't be cheated with AI", specifically university CS classes, I am all ears.
- I do not know the OP and I cannot prove or disprove any claims they make about their life, but I can indirectly attest to the following: I was competing around 2008-2010 at the regional level of the ICPC in Central Europe and indeed, our team's approach at the time had some memorization aspects as well. (Our university had a significant amount of support for the competitions, with some coaching as well as a course that consisted of weekly practice contests.)
We never won anything, so I would not dare claim we competed at a highest level. As far as I remember, most of our preparation was about "recognition" -- how to tell if a greedy approach is optimal, or how to recognize if a dynamic approach fits. And of course, how to write a program quickly and not forget any corner cases.
I remember having daydreams back then of memorizing a max-flow algorithm or potentially even a linear programming solver and then quickly retyping it at a competition. Flows and LPs indeed solve a lot of stuff (LPs are P-complete). I admit I never did that, and it wouldn't be a winning strategy there anyway.
PS: Oh, and contrary to the poster above, most of my friends from the university days would be and indeed were great hires, judging by their jobs at Google, Microsoft and elsewhere. Some others, such as the actual ICPC winners from our university, ended up pursuing academic careers -- but I dare not say they would have a bad time in the industry.
- > That's not an NP type problem
The comment I was referring to was talking about "decision problems and general problems" and there always being a reduction between them.
Now "general problems" is a bit vague, but in my classes on optimization the students are intuitively led to believe that optimization problems always have a decision problem associated with them, so we can talk about NP-hardness of optimization problems, too. Which is often true, but not always.
As a good example, if you consider graph coloring, you can argue that the associated decision problem is "given a graph G, and a parameter k, answer yes if G is colorable with at most k colors". This way, slightly informally, you can talk about NP-hardness of finding the smallest number of colors for a graph.
However, the optimization problem I presented -- coloring k-colorable graphs -- is a valid optimization problem, it is interesting and has been studied in the past, but it has no good decision problem associated with it.
- > Of course this ends up not mattering in practice since we can convert a problem with arbitrary (bitstring) output into a decision problem.
Not always. My favorite counter-example is coloring k-colorable graphs. Consider that for some reason (and there could be many), you are guaranteed that all the graphs on input are k-colorable. Still, the input is just a graph without any coloring. Your algorithm is tasked to find a proper coloring using the smallest number of colors.
It is both a problem that has been already studied in terms of approximation and at the same time an optimization problem that has no good decision version, as far as I am aware.
- > If you need to lookup stuff in your waste of material you won‘t be able to finish everything. The time constraint was very hard.
Did you enjoy this exam? I am asking as I had a very similar experience in my undergrad:
Our university allowed some basic courses to be studied at different departments, if they were equivalent. This means that there was a CS Major Algebra 1, but also Math Major Algebra 1, and you can take either.
I took the Math Major Algebra 1, being a CS student, and I have passed everything up to the final exam, where I learned that the exam is literally what you describe. All the proofs and arguments needed follow from basic principles (as things in Algebra 1 tend to do), but there is a lot of questions and the time limit is strict.
Thus, you have no time to actually do any deliberate thinking, you have to memorize and understand the basics so well that you can develop the arguments essentially in real time.
(And it was not an open book exam, even, but as you describe, it would not have helped you too much.)
I hated that exam. I never took it out of principle, instead just quitting the course and doing it with a great grade a year later, in CS. I still dislike the idea of forcing knowledge acquisition through strict time limits. What if somebody is smart but has a slow start due to stress? Ugh.
- > > and in the end only few of them attain their goal of becoming a professor
> Is that the goal?
I have seen only a small slice of all the theoretical computer science PhD students in my parts of the world (Central and Western Europe) but almost universally they passionately loved their work (both research and teaching) and would prefer to do it in the future.
"Becoming a professor" is one of the easiest ways to continue doing what you are doing, so I would say yes, it is a goal.
Like I have said elsewhere also, we are blessed to have many industry jobs in CS which are quite mentally challenging, and so for us it does not need to be the only choice. But still, a permanent academic position offers many things that the industry cannot -- hence a goal for many.
- Clearly a click-baity premise. If you allow me an equally click-baity metaphor, the author suggests to abolish the road system because there are too many traffic jams. My suggested solution is consistent across the metaphors: Keep the roads, but through other venues, get as many people the possibility to travel (do research and other mentally engaging work).
I feel us computer scientists and computer science students are in the best field in this regard. There are so many interesting CS jobs where you can both get a competitive salary and engage your brain -- often even in relation to what you worked on as a MSc/PhD student.
- > > And convincing people to sign up for a subscription when that is objectively terrible for the consumer is marketing.
> I see. So my Netflix subscription is terrible for me?
The parent's sentence is a "X when Y is marketing", and you are dropping the when clause completely. In fact, Netflix is probably one of the objectively best examples of subscriptions helping in some areas.
Since you ended with a question, let me do the same: Out of all the subscription packages, be it Manscaped monthly men's trimming tools, Hello Fresh, Office 365 subscriptions, Paramount Plus... can you consider one of them being objectively terrible for the consumer, and thus fulfill the when clause of parent's post?
- Indeed there is no longer a possibility to edit or delete for me.
I was careful not to include names or places, and all this information is easily searchable starting from the author's username on HN or the website name.
So while I maintain that I made my comment in good faith, I hereby acknowledge that it is okay if it gets deleted, should HN moderators be requested to do so.
Update: I will contact the HN moderators myself, as I feel it is the right thing to do here.
- People in this thread should take into consideration that the author submitted the post to Hacker News themselves. This is a call for the general hacker public to read it, and ultimately it cannot be undone easily.
I do understand the basic level of curiosity from fellow HN readers -- I did look up the research team and the supervisors mentioned. They do claim a really large area of research interests:
* Verification and Validation
* Search-Based Software Engineering
* Autonomous Driving
* Cyber-Physical Systems
* Digital Twins
* Quantum Software Engineering
It all adds something to the picture. That being said, I would not form any conclusions from this besides "a PhD student faces a crisis" -- unfortunately, this happens often and diagnosing those is really, truly difficult. (I am an assistant professor for just a year now, and I have seen those crises second-hand.)
Fully agree, in fact, this has literally happened to me a week ago -- ChatGPT was confidently incorrect about its simple lock structure for my multithreaded C++ program, and wrote paragraphs upon paragraphs about how it works, until I pressed it twice about a (real) possibility of some operations deadlocking, and then it folded.
> Every time a major announcement comes out saying so-and-so model is now a triple Ph.D programming triathlon winner, I try using it. Every time it’s the same - super fast code generation, until suddenly staggering hallucinations.
As an university assistant professor trying to keep up with AI while doing research/teaching as before, this also happens to me and I am dismayed by that. I am certain there are models out there that can solve IMO and generate research-grade papers, but the ones I can get easy access to as a customer routinely mess up stuff, including:
* Adding extra simplifications to a given combinatorial optimization problem, so that its dynamic programming approach works.
* Claiming some inequality is true but upon reflection it derived A >= B from A <= C and C <= B.
(This is all ChatGPT 5, thinking mode.)
You could fairly counterclaim that I need to get more funding (tough) or invest much more of my time and energy to get access to models closer to what Terrence Tao and other top people trying to apply AI in CS theory are currently using. But at least the models cheap enough for me to get access as a private person are not on par with what the same companies claim to achieve.