28 reputation
4
bio website
location
age
visits member for 2 years, 5 months
seen Sep 28 at 10:47

Sep
8
awarded  Tumbleweed
Sep
1
asked Are there “formal” versions of the Laplace transform?
Mar
2
comment Unification in languages without function symbols or with relational terms.
A remark to future readers. After some thought on the problem, I see that the real issue here is not whether the $f$ and $g$ are right-unique, but whether they are left-total. Left-totality guarantees that after all the terms of the predicates are chained, we have a valid instance for the formula. If the $f$ and $g$ relations were left-partial and then subsequently were composed over other relations in another substitution, there is no guarantee that the resulting composition has non-empty domain. Reaching contradiction will be henceforth pointless as it will never apply to any instance.
Mar
1
revised Unification in languages without function symbols or with relational terms.
Brown color in the first paragraph distracting.
Mar
1
comment Unification in languages without function symbols or with relational terms.
Another edit: One $p$ negated to apply the resolution like that. Sorry. In my defense, I can only say that my browser crashed the first time I wrote that.
Mar
1
revised Unification in languages without function symbols or with relational terms.
Wrong application for the resolutions.
Mar
1
comment Unification in languages without function symbols or with relational terms.
Edit: The formula for $\sigma$ in the second resolution was incorrect with respect to the role of $x$ and $y$.
Mar
1
revised Unification in languages without function symbols or with relational terms.
deleted 2 characters in body
Mar
1
asked Unification in languages without function symbols or with relational terms.
Jun
12
awarded  Student
Jun
11
comment Maximally entropy preserving irreversible functions. (CS related)
Then, the best I could do is to study the state of practice more carefully. Digest through related fields later, if time and skill permit me. Well, I have been warned. Thanks for the response.
Jun
11
comment Maximally entropy preserving irreversible functions. (CS related)
You are absolutely right, of course. Great omission on my side. But this leaves me with the "distribute the universe evenly" requirement to good hash functions, which is not the full story in practice. Aren't there fields that deal with the formal semantics of "mixing" the information, potentially involving models of the data, but with greater generality? Most searches for such treatment lead me to cryptographic articles, and I presume those will be focusing on the security perspective. Or are they connected?
Jun
11
awarded  Scholar
Jun
11
accepted Maximally entropy preserving irreversible functions. (CS related)
Jun
11
awarded  Editor
Jun
11
comment Maximally entropy preserving irreversible functions. (CS related)
Edit: size of P is greater than Q. Wrong direction of the inequality in my post.
Jun
11
revised Maximally entropy preserving irreversible functions. (CS related)
edited body
Jun
10
asked Maximally entropy preserving irreversible functions. (CS related)