JohnKemeny

7 ms·

61.
by JohnKemeny 1y ago
I prefer not to due to privacy concerns. Perhaps you can try yourself? I will say that after checking, I see that the model is set to "Auto", and as mentioned, used almost 8 minutes. The prompt I used was: Solve the follow
62.
by JohnKemeny 1y ago
There is a clear difference between what OpenAI manages to do with GPT-5 and what I manage to do with GPT-5. The other day I asked for code to generate a linear regression and it gave back a figure of some points and a line through it. If
63.
by JohnKemeny 1y ago
I went to ICPC's web pages, downloaded the first problem (problem A) and gave it to GPT-5, asking it for code to solve it (stating it was a problem from a recent competitive programming contest). It thought for 7m 53s and gave as reply
64.
by JohnKemeny 1y ago
What do you mean by creation. I'm a mathematician and my "creations" are small notes, comments, and very simple figures. I've never (besides flipping pages) experienced any noticable lag or delay.
65.
by JohnKemeny 1y ago
I travel a lot and bring it on the plane. It has thousands of pages of handwritten notes, and hundreds of text books and papers. In the airport or on the plane, I download papers I want to read or have to review. On touchdown, my reviews ar
66.
by JohnKemeny 1y ago
> "Even Apple" Literally the company of all time with most money
67.
by JohnKemeny 1y ago
Could it be caused by dry skin?
68.
by JohnKemeny 1y ago
Look at their actual papers before making a comment of what is or isn't their core field: https://dblp.org/pid/35/3081.html
69.
by JohnKemeny 1y ago
They are physicists and will therefore talk about things that make sense to them. What they aren't: computational linguists and deep learning experts.
70.
by JohnKemeny 1y ago
I asked ChatGPT and it agrees with the statement that it is indeed wild
71.
by JohnKemeny 1y ago
Turing, Church, and even Knuth got their degrees before CS was an academic discipline. At least I don't think Turing studied Turing machines in his undergrads. I'm saying that lots of people like to post their opinions of LLMs re
72.
by JohnKemeny 1y ago
As you note, some physicists do have computing backgrounds. I'm not suggesting they can't do computer science. But today, most people hold opinions about LLMs, both as to their limits and their potential, without any real knowledg
73.
by JohnKemeny 1y ago
He's a chemist. Lots of chemists and physicists like to talk about computation without having any background in it. I'm not saying anything about the content, merely making a remark.
74.
by JohnKemeny 1y ago
But then the claim is meaningless.
75.
by JohnKemeny 1y ago
> The audience cannot care about your work until they understand the ‘value proposition’, to use still more contemporary capitalist jargon. Hard disagree. It is easy to imagine a problem that just sounds FUN.
76.
by JohnKemeny 1y ago
> Every talk must begin with its motivation Must is a strong word. Surely there exist good presentations that begin with something else.
77.
by JohnKemeny 1y ago
Agreed. Pandoc with some webpage template (bootstrap).
78.
by JohnKemeny 1y ago
Is Dropbox still in use, though?
79.
by JohnKemeny 1y ago
Not so much outdated as simply not filled in. This is a submitted pdf, not proofed pdf. You can see that both volume and page numbers are missing. These are things filled in by the journal in the proofing stage (after peer review).
80.
by JohnKemeny 1y ago
I think, in fact, for every prime number p at least 5, 4 mod p is (congruent to) 4.
81.
by JohnKemeny 1y ago
Indeed, the situation reminds me of those people on reddit who invite 20 people to a party and are surprised when nobody shows. Of course there is supposed to be competition when applying to positions, but you should have a good idea of you
82.
by JohnKemeny 1y ago
These are very bad advice, and it's clear why you needed to send 450 applications. I've only once applied to a job I didn't get, and I've had more than 10 jobs. It's called networking. Here is one advice to rule the
83.
by JohnKemeny 1y ago
If you were working this to be the first to do it, I have bad news... One of our projects in algorithms/data structures was to do a BFS on the Wikipedia dump. In 2007.
84.
by JohnKemeny 1y ago
Emacs has an artist-mode , you know.
85.
by JohnKemeny 1y ago
n log n is a lot like n, in that if n less than a trillion, n log n is at most 40•n.
86.
by JohnKemeny 1y ago
You can simply say grows as n⁷. Although people will understand what you mean by saying O(n⁷), O is an upper bound , not a lower bound. What you should say if you want to be correct is it grows as Ω(n⁷).
87.
by JohnKemeny 1y ago
Okay, I see what you mean. It really hinges on what is meant by "this question", i.e., Given the code of a computer program, can you tell whether it will eventually stop or run forever? If what's given to you is the code a
88.
by JohnKemeny 1y ago
"this question" is Given the code of a computer program, can you tell whether it will eventually stop or run forever? It is indeed the Halting problem. (Except that they forgot to state what the input is (the code itself).
89.
by JohnKemeny 1y ago
OKLCH: a color model based on OKLab (a perceptually uniform color space) where you control Lightness , Chroma (saturation), and Hue . "OK" because "it does an ok job" according to its creater Björn Ottosson.
90.
by JohnKemeny 1y ago
Are you suggesting to bump to Python 4 in order to be able to write `{}` instead of `set()` (or `{/}`) and simultaneously break all existing code using `{}` for dicts?

More ›