sischoel

5 ms·

1.
by sischoel 9mo ago
The issues with auto-translated Reddit pages unfortunately also happens with Kagi. I am not sure if this is just because Kagi uses Google's search index or if Reddit publishes the translated title as metadata. I think at least for Goog
2.
by sischoel 1y ago
Dotted notation would not work because the keys in a dict can also contain dots. I am not terrible familiar with them but there is something called `lenses` that comes from functional programming that should allow you to access nested struc
3.
by sischoel 1y ago
Or use itemgetter: >>> from operator import itemgetter >>> dct = {'greeting': 'hello', 'thing': 'world', 'farewell': 'bye'} >>> thing, greeting =
4.
by sischoel 2y ago
I was looking a bit at the code for the shared memory implementation in https://github.com/3tilley/rust-experiments/tree/master/ipc and the dependency < https://github.com/elast0ny&#x2F
5.
by sischoel 2y ago
The CUDA documenation tells me that there are more performant but less precise trigonometric functions: https://docs.nvidia.com/cuda/cuda-c-programming-guide/index.... Do you know if that hardware pipeline works o
6.
by sischoel 3y ago
I am not sure if this was the very first paper talking about attention, but https://arxiv.org/abs/1409.0473 from 2014 is a famous one. What is still missing there, is the idea of self-attention.
7.
by sischoel 3y ago
Do you have any sources on that? The only thing I could find was that some parties want to ban digital billboard in the city of Zurich (not the whole canton).
8.
by sischoel 3y ago
A few years ago I was trying if I could port that code to Linux. I made some decent progress, but in the end I got stuck trying to convert the resources (images and audio files) to a more modern format. For example, the PICT format ( https:
9.
by sischoel 4y ago
There are some very explicit images for the default prompt when one scrolls a bit around there, can't imagine that OpenAI would not filter these out.
10.
by sischoel 4y ago
When one talks about the average income, does that average only consider people that work? Otherwise, in countries with a high rate of unemployment, I would imagine that a single salary might have to feed the whole extended family, so that
11.
by sischoel 4y ago
It is indeed O(N). There is also a more efficient algorithm (in case the range is small) that uses binary search to find the first index. Such an algorithm would have time complexity O(log(N) + H) where H is the number of elements in the ou
12.
by sischoel 4y ago
From skimming the paper ( https://arxiv.org/abs/2211.09055 ), the proof seems to be amazingly short and relies only on a few theorems that one encounters in introductory class on information theory. Definitely recommenda
13.
by sischoel 4y ago
Why is that though? Wouldn't something like `mov eax 0` also work?
14.
by sischoel 4y ago
Isn't that the case for most programming languages? The only exceptions I can think of are C++ and Rust.
15.
by sischoel 4y ago
Do you know any sources on on how set equivalence theory is related to integer programming? Because I don't see the immediate connection and I could not find anything on the internet, but maybe I used the wrong terms.
16.
by sischoel 5y ago
Such graph collections are super helpful when trying to figure out if some theorem holds for a certain graph class, although only up to a certain size. I think a lot of these graphs where generated with the genc.c program included in nauty
17.
by sischoel 5y ago
C and C++ do not have labeled breaks - Java indeed has. But of course you are right, that one could just use goto for C/C++.
18.
by sischoel 5y ago
Genuine question, not a comment on OPs implementation: What is the reason that people so often use some external service for creating task queues (often backed by some kind of db), instead of just implementing it themselves in whatever lang
19.
by sischoel 5y ago
The page is from 2008 - unfortunately a lot of links to the original pictures do not work anymore.
20.
by sischoel 5y ago
One could argue that Julia is just Lisp with a syntax that appeals more to popular taste. There is also a secret option to get into a lisp repl in Julia "julia --lisp".
21.
by sischoel 5y ago
Indeed, there are quite a few application in cryptography, where one has to search trough a huge space. Wikipedia actually listens a few: https://en.wikipedia.org/wiki/Cycle_detection#Applications
22.
by sischoel 5y ago
It looks as if this year only repos with the topic "hacktoberfest" or PR's with the the tag "hacktoberfest-accepted" participate, so this should limit the amount of spam. Source: https://hacktoberfest.dig
23.
by sischoel 5y ago
What about "data engineer"? There seem to be a lot of jobs for that title nowadays.
24.
by sischoel 5y ago
Yes, I hadn't thought about that before, but of course the difference here is that the Rust compiler cannot just produce a "good enough" result for pattern matching.
25.
by sischoel 5y ago
While this is an interesting result, isn't basically every compiler NP-hard, because of register allocation?
26.
by sischoel 5y ago
Although it is possible to create branchless binary search. Here is one article: https://schani.wordpress.com/2010/04/30/linear-vs-binary-sea... , there are probably other ways to do that. Another interesting
27.
by sischoel 5y ago
Thanks, I had not seen that dissertation yet, it has much more information than that arxiv link - here is a a pdf of that dissertation that google gave me: https://www.illc.uva.nl/Research/Publications/Dissertation
28.
by sischoel 5y ago
I think there is a mistake in that article: One has to fix a specific language before and then determine the Kolmogorov Complexity of an input - one is not allowed to take a separate Language for each input, unless one also encodes how that
29.
by sischoel 5y ago
This article is surprisingly short on actual applications. For some interesting applications one might look at the the Wikipedia article for the normalized compression distance: https://en.wikipedia.org/wiki/Normalized_
30.
by sischoel 5y ago
It might be possible that candidates are afraid that their solution is not clever enough for you, i.e they assume that you want something like a one line formula that only contains numbers and basic arithmetic operators. The way I would sol

More ›