Jump to content

Talk:Indeterminacy in concurrent computation

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Linas (talk | contribs) at 04:19, 16 September 2005 (Article for deletion?). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Article for delection?

I dunno, this article just sounds plain old confused and wrong to me; I'm tempted to suggest deletion. Arguing that a hung gate is a form of quantum indeterminacy is certainly a novel idea, but I think a whole lotta work would need to be done to prove this, in particular, ruling out purely classical explanations like ground bounce and what not. I doubt that anyone who actually designs real transistors for a living would agree with such an assessment. I'd need to see something other than handwaving to believe this. linas 04:19, 16 September 2005 (UTC)[reply]