Computer scientist working on programming language design, formal methods for software product line engineering and security, with a smattering of logic and coordination in there for good measure.

4h
answered Is it appropriate to email some new information to my recommendation-letter writers on Thanksgiving if the deadline is a few days later?
4h
comment Expected length of longest construction path in Barabási–Albert Model
Thanks. It'll see what I can make of this. I think for large graphs the seed graph should not matter. Ultimately, it is not so interesting for me, so it could be any small clique (such as the one you assume).
5h
comment Expected length of longest construction path in Barabási–Albert Model
@JoshuaGrochow: Thanks for the reference. The seed graph is not so important, so perhaps their analysis will be useful.
7h
revised Expected length of longest construction path in Barabási–Albert Model
edited tags
8h
comment Expected length of longest construction path in Barabási–Albert Model
@RaduGRIGore: I guestimated $O(\log n)$ ... that would make me happy. Correctness of the derivation would make me happy too. Feel free to add your calculations as an "answer-in-progress".
1d
asked Expected length of longest construction path in Barabási–Albert Model
2d
comment Is There a Programming Language That Embraces Globals?
@babou: Only God is more global than literals. Literally. (Except for the whole figurative nature of God.)
2d
comment Is There a Programming Language That Embraces Globals?
I don't know about "embracing global references". Old Fortran variants only allowed you to express global variables. These days we would describe this as "not knowing any better".
2d
comment Substitution-based Operational Semantics of algebraic datatypes
You would need to say what your "construct" operation does. What does it construct?
2d
comment Calculating time for refreshing the whole memory
What do you think? BTW: This isn't a forum for dumping homework questions.
Nov
24
awarded Enlightened
Nov
24
comment Split a number into its digits with Haskell
digs 001 = digs 1 = [1] because 001 = 1.
Nov
24
awarded Nice Answer
Nov
24
answered Is it self-plagiarism to reuse my own unpublished material?
Nov
23
awarded Yearling
Nov
23
awarded Autobiographer
Nov
23
revised Can a solvable problem be encoded in a recursively enumerable language?
added 59 characters in body
Nov
23
answered Can a solvable problem be encoded in a recursively enumerable language?
Nov
23
answered Pierce's Types and Programming Languages : circular definition of terms?
Nov
22
revised Does any one know what this problem is called?
added 9 characters in body; edited title
1 2 3 4 5