stygianguest
Joined 16 years ago
Joined 16 years ago
France on the other hand has had a minimum wage for a long time and a 35 hour work week. To me it isn't so clear who is doing a better job.
But clearly French unions are not afraid of confrontation.
The correlations are done in the frequency domain. And, although I didn't look into it, I suspect they have pretty good algorithms to compute the correlations themselves. At least they have very smart people working on that.
Scientific funding, however, does. This is one reason why it is crucial that taxpayers can connect with scientific success. For ESA this is problematic because their success gets distributed, consequently most Europeans might not even know it exists.
That is also why the spying on Merkel is extremely harmful to American-German relations. It changes the view of the public at large on the US.
But formal methods, which typically are based on computer-checked proofs, can help you to eliminate certain possibilities. They are severely underestimated and underused because of our dependence on C.
The formal methods do not 'fail' as such. They just fail to prove anything boyond the proven property. Such properties can very well (and often do) include failure (of whatever kind) of parts in the system.
Apart from AI, which as an approach to embedded systems is almost by definition the opposite, I only see one way forward from the mess we're in now: formal methods.
See: http://en.wikipedia.org/wiki/Intuitionistic_logic
In practical terms, however, this isn't a huge hurdle and comes with the nice advantage that you always have a program.
BTW. I'm kinda sure you know this already, but I think it is important to mention.
Thanks for the Haskell proof-book link. I'll check it out sometime.
Check for example Lustre/Scade: http://www.esterel-technologies.com/ or its more recent successor Lucid synchrone: http://www.di.ens.fr/~pouzet/lucid-synchrone/
The latter has explicit recursion which can be disabled when designing embedded systems.
Haskell libraries closely follow this paradigm with their functional reactive DSLs. Recursion is actually useful to recursively define circuits with repeated patterns, e.g., the butterfly FFT.