Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
kmill
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
47 ms
·
391.
▲
by
kmill
9y ago
> Additionally there is no such thing as pure green, because all radiation that green feeds on will also feed either red or blue as well. You can exploit cone fatigue to experience a greener green: make the red and blue people play tug o
392.
▲
by
kmill
9y ago
1. If you can calculate rough bounds for the terms and their derivatives in the winding number integral, you can figure out how densely you need to sample the curve to calculate the integral exactly. 2. If the winding number is zero, there
393.
▲
by
kmill
9y ago
If you want to play with the winding number proof of the fundamental theorem of algebra, here's a toy I made a while back to help my linear algebra students (hopefully) gain some intuition for complex numbers: https://math.b
394.
▲
by
kmill
9y ago
Incidentally, the S combinator shows up in the J language as the "monadic hook". If f and g are functions, where f takes two arguments and is written infix (so "x f y" is how you write the application of the arguments x
395.
▲
by
kmill
9y ago
I have the impression that you feel like you need to correct what I say because I am not saying things exactly the way that you think about them. Please forgive me: I am not interested in having this kind of discussion.
396.
▲
by
kmill
9y ago
A few years ago, I actually searched around for an implementation of the classic finder, so this is very amusing for me to see actually implemented! What I was interested in back then was the idea that there was a direct correspondence betw
397.
▲
by
kmill
9y ago
I wasn't aware of SBCL's interpreter mode, but it does say "in SBCL interpreted code is not safer or more debuggable than compiled code." I haven't used it myself yet, though, so it's possible there are intere
398.
▲
by
kmill
9y ago
I have to say, I do not understand what you are addressing in my comment: whether you are rebutting, agreeing, expanding, informing, thinking out loud, or simply expressing what you think is special about Lisp. > The interface for EVAL a
399.
▲
by
kmill
9y ago
If that's not observable to the program, so what? At a math lecture I once went to, the speaker said "sure, define it that way, but show me the theorems!" Everyone seems to have their own idea for what homoiconicity means, b
400.
▲
by
kmill
9y ago
This is a reasonable characterization of homoiconicity. Interestingly, by this definition, v8's implementation of Javascript is homoiconic since functions can be converted to strings, recovering the actual source text for its definitio
401.
▲
by
kmill
9y ago
> The problem with these schemes is that they're at odds with metaprogramming. One huge advantage of s-expressions is that the code is expressed using data literals. I don't think it is necessary for there to be a single unifor
402.
▲
by
kmill
9y ago
Maybe that's the goal of a compiler (though I'm not sure I agree), but that, to me, is somewhat subservient to language design and expressivity. You can't really dismiss a language feature because an imagined implementation o
403.
▲
by
kmill
9y ago
Somehow Schemers manage. Or maybe I'm just thinking of Oleg Kiselyov http://okmij.org/ftp/continuations/
404.
▲
by
kmill
9y ago
There can be some value in collapsible types, so long as there is a delimiter you can throw in. For instance, you could return a promise in a one-element array. For Perl (which I don't know) I could imagine the argument went that join
405.
▲
by
kmill
9y ago
Just yesterday someone was telling me about using diffraction for imaging. He also mentioned the work of Laura Waller, who apparently is able to get 3D images of a scene by putting translucent-but-not-transparent tape directly over the len
406.
▲
by
kmill
9y ago
Descriptions of typing are about as unevenly used as descriptions like "pass by reference." (So, practically useless.) In Lisps: - values have types (bool, symbol, number, list, array, structs, functions, ...) - variables have by
407.
▲
by
kmill
9y ago
Back when https://xkcd.com/1930/ was posted, I made a regular expression to create a generator using a regex sampler (for instance http://dwickern.github.io/regex-sample/ ). I've put the rege
408.
▲
by
kmill
9y ago
Page 82 of https://www.sciencedirect.com/science/article/pii/0315086078... has some information. Zorn introduced a "maximal principle" as an axiom. It appears Tukey called a generalization of it Zo
409.
▲
by
kmill
9y ago
Would you know that some Javascript engines store primitives on the heap, so potentially it can all be described as call-by-sharing? Then again, they are immutable, so it is indistinguishable from call-by-value. I think making these distin
410.
▲
by
kmill
9y ago
> Is Rust pass-by-reference or pass-by-value? Well, the question is invalid, in either the original or the modern mutation of the meaning. What do you mean? Maybe you mean "invalid" as in "no one should ask this anymore,&q
411.
▲
by
kmill
9y ago
Off the top of my head, here are languages in use that have a feature for pass-by-reference semantics: C#, Ada, C++ (though in this language you can get ahold of the reference as a value if you want). Of course, to implement pass by referen
412.
▲
by
kmill
9y ago
Something I find interesting is that, although on the surface this seems like a way to deal with rotations in general, it only works for certain angles. For instance, with a 45 degree rotation, you have to scale the image, too, and the res
413.
▲
by
kmill
9y ago
I took it to mean he was doing the old-timey thing of putting up a plaque saying the name of the business, a slogan, and the proprietor. (In commerce, quote marks tend to indicate emphasis or a slogan.)
414.
▲
by
kmill
9y ago
I tried it with a few examples ("Hx", "x=y", Correa's counterargument) but it seems to always throw this error: > Error: TypeError: constructProposition(...).findExample is not a function I've enjoyed playin
415.
▲
by
kmill
9y ago
It has quantifiers so it would be predicate calculus (first-order logic) - https://en.wikipedia.org/wiki/First-order_logic I thought the question was more about the syntax of the logic language (which I think is rather
416.
▲
by
kmill
9y ago
> So how can I compare the multiline Hs->~Ms with a ~(Hs->Ms) that has the same newline behavior? I was wondering about that, too, but I could only figure out putting it all on one line. > Is this syntax based on the syntax used
417.
▲
by
kmill
9y ago
> ~(Hs->Ms) <=> Hs->~Ms [...] this is contingent [...] Though technically this is a false statement It's just not provable. The webapp can give the example of a world with a single object that is neither H nor M (in whi
418.
▲
by
kmill
9y ago
It is indeed contingent. The intuitive problem is that "a -> ~b" is not logically equivalent to "~(a -> b)". The "Counterexample" button shows a world in which the modified statement is false: there is a
419.
▲
by
kmill
9y ago
The program can output "necessarily true" if it is true in all possible worlds, "self-contradictory" if it is false in all possible worlds, and "contingent" if it is true in some and false in others.
420.
▲
by
kmill
9y ago
This is both a regex parser and a regex matcher, and I believe fao_ meant the matching part.
More ›