On 2010-03-05, at 00:06, Michael Arnoldus wrote:
So my suggestions was to use complexity in the context of improving
programmer (FSE) productivity. And I hinted at some possible
measurements that might be useful for this. I however do not in any
way pretend this is clear enough to work as a
On 2010-03-04, at 19:45, Andrey Fedorov wrote:
You're talking way past me. By "complexity" I just mean "how hard is
this to understand?". A experiment to measure of complexity of some
code would be taking an experienced Java engineer, giving him Java
code he hasn't seen, and asking him to u
On 2010-03-04, at 18:12, Alejandro Garcia wrote:
Now given those rules:
If in system A I set one of the nodes to TRUE I don't know the state
of the whole system.
This system is harder to know it has 16 possible states (2^4)
If in system B I set bottom node to TRUE then turns out all the
Thank you.
I'm not familiar with his work.
But will be soon ;-)
On Sun, Mar 7, 2010 at 5:49 AM, Felix Holmgren wrote:
> I wonder if people in this discussion have studied the work on hidden
> algebra, by the late Joseph Goguen. This includes techniques for
> automatic reasoning about stateful sy
Joe was a friend of mine, and I agree that his work is amongst the most
important and inspiring in trying to think about the designs of systems, and
being able to characterize them with "meaning which allows reasoning". I was
surprised to note that I didn't cite him in the NSF proposal (probably
I wonder if people in this discussion have studied the work on hidden
algebra, by the late Joseph Goguen. This includes techniques for
automatic reasoning about stateful systems and other systems that are
otherwise hard to study formally:
"Hidden algebra effectively handles the most troubling feat
