tgflynn

6 ms·

1.
by tgflynn 5mo ago
Hello, I'm the author of this project. Please let me know if you have any comments or questions.
2.
Show HN: Julius, a New Lisp Implementation(github.com)
14 points by tgflynn 5mo ago|2 comments
3.
by tgflynn 3y ago
I wonder if that characteristic correlates with greater math ability.
4.
by tgflynn 3y ago
It's rather ironic that a discussion on what Christians believe would be based entirely on quotes from before the birth of Christ. I think though that he did say something relevant to the question at hand: "The kingdom of God is i
5.
by tgflynn 3y ago
Sorting has a simple local optimum implies global optimum property. If a list is sorted than any (not necessarily sequential) sublist is sorted, and the converse. No such property applies to TSP. I think that the best way to think about w
6.
by tgflynn 3y ago
That still seems like a major issue, because I and probably quite a few other people rely on the security page to decide when to look into upgrading. I hope there is some rationale for why the security fixes in later releases were not serio
7.
by tgflynn 3y ago
That's concerning. Do you have a link/source for that ?
8.
by tgflynn 3y ago
Out of curiosity, what would be the advantage of DTL over TTL, which I would think would be the default choice for building discrete logic circuits ?
9.
by tgflynn 3y ago
Yeah, that might work with a default keyboard layout but it doesn't work with a polytonic Greek layout. How would you type a lowercase alpha with an acute accent and a macron that way ?
10.
by tgflynn 3y ago
Yeah, I was hoping to find some general information on how the Compose key is (or was) supposed to work. It's easy to find info on how to assign the Compose key to a particular key but I haven't found anything on how to actually
11.
by tgflynn 3y ago
Has MRI actually been proven to work with similar carbonized scrolls ?
12.
by tgflynn 3y ago
Does anyone know of a good resource explaining how the compose key is supposed to work in general beyond the simple cases like those discussed in this article ? I have an interest in some less spoken languages like Ancient Greek and Sanskri
13.
by tgflynn 3y ago
I assume it's just old inventory. It's not supposed to be refurbished because I enabled the "New" filter.
14.
by tgflynn 3y ago
Yes, and you can still buy those new on Amazon with no mention that they're unsupported, just like the chromebooks.
15.
by tgflynn 3y ago
With the high level of self awareness that you've developed as evidenced by this post I would think you would be largely immune to falling into the kind of traps you're worried about. Maybe you should ask yourself why you don&#x2
16.
by tgflynn 3y ago
Not to diminish the achievements of these people but I suspect being in the right place and time has a lot to do with it. I suspect that for each of the names you cited there are a thousand others who were equally as technically skilled bu
17.
by tgflynn 3y ago
> there is no parallel track and parallel solvers are disqualified [1] from participating. Maybe that's as much a cause as an effect. What's the incentive to create and improve parallel solvers if there's no place that ev
18.
by tgflynn 3y ago
Upvoted because I'd like to see an answer to this question too. I've heard a lot about IDA Pro but I've never used it. What are the most important functions it has that you can't do with, say, gdb ?
19.
by tgflynn 3y ago
Ah, OK thanks, that definitely could have been more clearly explained.
20.
by tgflynn 3y ago
I'm stuck in the III.A "Main Idea" section where he says: > Doing this enables us to represent each Di as a variable sequence, but with all the negative literals being removed. See Table I for illustration. What justificat
21.
by tgflynn 3y ago
There's one thing I'd like to get some clarification on. You said in an earlier comment: > I am reducing to 2XSAT, which is a name for instances that are intersections of 2-SAT and XORSAT instances. It seems to me that 2-SAT a
22.
by tgflynn 3y ago
Why don't you try testing your algorithm on some 1000 variable or so SAT instances ? There are thousands of such problems that have been created for the SAT competitions. If your code can solve all of them and is really P-time then I
23.
by tgflynn 3y ago
A decision problem as used to define the classes NP and P is of the form: does there exist an x such that F(x) = 1, where F is a P-time computable function. If you can solve that problem in P-time then you can also solve the functional vers
24.
by tgflynn 3y ago
That's the kind of argument I've never put much credence in, otherwise I never would have even attempted to solve the problem. I still think it's possible that there could be a relatively simple solution that has so far elude
25.
by tgflynn 3y ago
I've spent a great deal of time over the last decade+ trying to find an efficient algorithm for NP hard problems and one thing I've learned is that this field is a graveyard for seemingly good ideas. Therefore I tend to be very s
26.
by tgflynn 3y ago
There's a huge difference between recognizing that most software will have some bugs and creating a system that's so broken by design that you have to invent a fictitious island to work around it.
27.
by tgflynn 3y ago
If you can handle an error and still return meaningful data that's fine, but returning the coordinates 0,0 to the user because GPS isn't working is far worse than giving them an error message. At that point you're essentiall
28.
by tgflynn 3y ago
That's what NULL (or it's various equivalents) is for.
29.
by tgflynn 3y ago
This makes no sense to me. Generally speaking an application should return an error message or code when something goes wrong, not a potentially valid piece of data. That an entire industry would adopt this kind of workaround for poor sof
30.
by tgflynn 3y ago
Yeah, what I said isn't completely accurate, because I didn't take into account the tax rate. But the factor is still larger than 1, assuming you have any revenue at all, because in addition to what you payed them in salary you h

More ›