Washing dishes can be a creative act (but it depends a lot on who is doing it).
https://www.youtube.com/watch?v=wn8XFiAwLkM
Readit Newsjnordwick commented on AI poetry is indistinguishable from human poetry and is rated more favorably nature.com/articles/s4159... · Posted by u/lr0
What's so hard about Day 12?
It's just
+/'{x:".",x;H:(-1+;1+i-)@'+|\m*i:!#m:x=\:"#."
R:(x=x)({[h;d;x;y;z](z#0),+\(((-z)_~"#"=x)&z_d>z)*(*y),(-z+1)_y-0^y h}. H)[x]/y
(*|R)-R@*|0,&1_*+m}.''1({("?"/:5#,x;,/5#,y)}.')\@[;1;.:]'" "\:'0:`:i/12.txtI'm doing this year in K2 (after a long hiatus from K). Is there a K4/5 binary? ATW gave me a K2 binary, but I miss some of the K4 and later functionality):
This is my fourth year. I'm using Go while being surprised how inadequate it is for this kind of problem. Standard libraries lack basic data structures and often Go is too slow for a compiled language!
I'm doing it in K2 this year (a language that has a single data structure: a vector). If you can do it in K2, you can do it in Go.
jnordwick commented on RFC 35140: HTTP Do-Not-Stab (2023) 5snb.club/posts/2023/do-n... · Posted by u/zkldi
Why is it a binary value? What about masochists, or people who lost a bet and want to be stabbed just a little? Or strangled?
You can put a window that covers the bottom half of the content the defaults to all assaults being allowed also has a way to customize which assaults you would like. It shouldn't be possible to uncheck necessary assaults for the website might not work.
jnordwick commented on Nash equilibria in Ballmer's binary-search interview game quuxplusone.github.io/blo... · Posted by u/xlinux
Can't this be solved to some sort of DP way of solving the sub problem?
Do the payout between 0 and 1 as the percentage of the amount.
With a range of 1 to 1 to pay off is obviously one
With a range of 1 to 2 the payout is .5
At three values it becomes more interesting. There are two strategies for the candidate either a binary search for the endpoints.
At four values you still have one level of binary search possible but after that it devolves down to the two value problem.
At five values. If the interviewer thinks the candidate would choose binary search and it becomes too too value problems on each side after removing the middle element.
There's definite problems with this but I wonder if he's already possible pay off matrix
jnordwick commented on Nash equilibria in Ballmer's binary-search interview game quuxplusone.github.io/blo... · Posted by u/xlinux
I always felt that part of the interview process is the candidate asking clarifying questions as well as making and stating assumptions.
I hate that. It turns the problem into one of those lateral thinking puzzles we were told some basic information and then the answer winds up being something totally wildly different. It wasn't being very random in the end not being very productive
Does anybody else always read this as Hyrule's Law?
jnordwick commented on SICP: The only computer science book worth reading twice? (2010) simondobson.org/2010/05/1... · Posted by u/pieterr
I took cs61a at Berkeley as my very first computer science class I couldn't program I never tried to so scheme was my first language.
My ta told me that everybody should take the class twice when you first come in and when you're graduating.
When you first take it especially if you know other languages like C at the time you don't get the full depth of the problems you're given a great introduction and you think you understand everything but you don't realize the depth of complexity. Message passing the metacircular evaluator, continuations as the basis of all flow control, etc
You think they are neat tricks that you understand the curriculum because you can do the homework you don't understand how those neat tricks are really the basis of everything else you'll do.
When you're graduating you've had time to go through all your classes you realize just how foundation was principles are and you get so much more out of the book.
Well I didn't take the class a second time I need help grade and TA for a couple semesters.
I work as a quant developer and in trading now and even though my field has nothing to do with that I still think it's the basis of me as a developer.
jnordwick commented on Bringing Faster Exceptions to Rust purplesyringa.moe/blog/br... · Posted by u/stpn
This doesn't really make sense. The branch predictor relies on a history of previous executions of that branch, or on explicit hints, to decide if a branch will be taken or not. Based on this prediction, the speculative execution hardware then sees the jump (return/panic) and loads the code from that address into the icache. There is 0 difference between `if (condition) jump $panic_recover_address` and `if (condition) jump $function_return_address` in terms of how easy or hard it is to predict or speculatively load based on the prediction.
I thought the Branch Target Predictor on x64 was global, not local, and it has to kick in before decode so even direct branches can be mispredicted. Branch prediction is 2 parts - the conditional predictor and the target predictor. The conditional predictor is actually per 64 byte instruction block (so if you have a few branches consecutively they share branch predictor entries and can step on each other. the target predictor uses a global history and needs to happen very early to keep the front end fed.
jnordwick commented on Nulls: Revisiting null representation in modern columnar formats dl.acm.org/doi/10.1145/36... · Posted by u/tosh
>and that is more important than CH I think.
If measured by $$$$$ clickhouse certainly has more installations.
CH definitely has more installations. not sure about which pulls in more revenue. KDB installations will run you $250,000/yr on the low-end for just the software license. Not sure how that compares.