nmadden

15 ms·

211.
by nmadden 7y ago
CLP shares some similarity with Satisfiability Modulo Theories (SMT). Is there much overlap in how they are used in practice? When would you reach for SMT over CLP?
212.
by nmadden 7y ago
I’m sure that’s a common problem.
213.
by nmadden 7y ago
Unlike unchecked exceptions.
214.
by nmadden 7y ago
He is also the author of https://www.bearssl.org/
215.
by nmadden 7y ago
While Prolog’s operational semantics are given in terms of least Herband models (at least, before you consider negation), you can also view a Prolog program as a subset of FOL and give a traditional model-theoretic account of the semantics.
216.
by nmadden 8y ago
Great post! Still working through it, but there is a slight error in the nested diagram at the start. Relational algebra has set difference, which is akin to negation-as-failure, but it lacks recursion. So the positive Datalog and RA circle
217.
by nmadden 8y ago
It's 12 bytes for both.
218.
by nmadden 8y ago
Thanks, I’ve not seen that before. It looks like a great read.
219.
by nmadden 8y ago
I don’t know much to point you at sorry, apart from general works on denotational semantics.
220.
by nmadden 8y ago
The first author of this is John Alan Robinson, inventor of the first unification algorithm and thus the first practical resolution theorem proving algorithm, on which Prolog was developed. I remember reading a history of Prolog, I think by
221.
by nmadden 8y ago
I think this is what Pulumi ( https://www.pulumi.com ) is trying to achieve.
222.
by nmadden 8y ago
Catching all exceptions is what we used to do in Java - using checked exceptions. It turns out that in many cases the caller cannot do anything sensible with most exceptions, except to let them bubble up to a higher layer. Eventually you re
223.
by nmadden 8y ago
This reply from Tom Lane reminded me of the PC losering issue from the “worse is better” essay [1]. > 2. What is the rationale for supposing that a retry a nanosecond later will help? If it will help, why didn't the kernel just do
224.
by nmadden 8y ago
Firstly, this is just authenticating the same factor over a different channel. (Actually the exact same credential). So not 2FA. Secondly, if I can successfully get you to approve my login request then I not only get logged in but also rece
225.
by nmadden 8y ago
Really? It’s called Graph QL and its schema can’t describe a simple tree?
226.
by nmadden 8y ago
We have been looking at something very similar (using scrypt and Ed25519) at work for LDAP (SASL) authentication. The primary motivation for us is to move costly password hashing off the LDAP servers. Our current design is basically the sam
227.
by nmadden 8y ago
Right. Most applications and protocols only need authentication. Non-repudiation is kind of an extreme security property, rarely needed outside of legal/financial transactions.
228.
by nmadden 8y ago
Non-repudiation means that the party that sent a message cannot later deny having sent it. In TLS both sides negotiate a shared secret key(s) that they then use for fast symmetric crypto for the actual messages. Symmetric because both sides
229.
by nmadden 8y ago
There is a (now expired) draft for sending signed HTTP requests using JWS that includes the access token as part of the signature data getting around this problem. Edit: forgot the link https://tools.ietf.org/html/draft
230.
by nmadden 8y ago
TLS certs (client or server) are only used during the handshake. After that it’s symmetric crypto, so no non-repudiation if that’s what they want. (Real non-repudiation requires a lot more than just signatures though, otherwise you could ju
231.
by nmadden 9y ago
I haven't followed the process, but if they just wanted to break up rt.jar, why didn't they do just that and break it into smaller jars that you may/may not include on the classpath?
232.
Stateless Session Logout with Rolling Bloom Filters(neilmadden.wordpress.com)
2 points by nmadden 11y ago|0 comments
233.
Solving the GCHQ Christmas Puzzle (part 1) with Constraint Programming(neilmadden.wordpress.com)
2 points by nmadden 11y ago|0 comments
234.
by nmadden 11y ago
Now we are definitely going in circles.
235.
by nmadden 11y ago
For example, see this old commit setting the WebKit maximum nesting depth to 2048. I am told it is 512 by default today. https://www.mail-archive.com/webkit-changes@lists.webkit.org... I'm fairly certain all browsers w
236.
by nmadden 11y ago
Well you can keep picking nits about implementation choices, but unless your stack can grow unbounded (because you have unlimited resources) then you haven't implemented a PDA and haven't removed any restriction at all. You'v
237.
by nmadden 11y ago
Thinking about this some more, there is no reason that a large number of states has to have a proportional amount of memory. If the states are represented in binary notation (thus needing logarithmic number of bits) and the state transition
238.
by nmadden 11y ago
You are confusing regular language with finite state machine. I don't know why there is so much resistance to this. All real machines have bounded memory available to them, thus they can only accept regular languages. Therefore, regula
239.
by nmadden 11y ago
Sure, but that doesn't change the fact that you cannot implement anything at all that accepts more than a regular language. In practice, however you implement it, you will have only implemented something equivalent to some finite state
240.
by nmadden 11y ago
You can't always give me a larger HTML document - eventually you will run out of usable universe. Yes, I should have said 'bounded by some finite maximum size' rather than just finite, but it's not a great leap to see th

More ›