Show simple item record

dc.contributor.authorPanangaden, Prakashen_US
dc.contributor.authorShanbhogue, Vasanten_US
dc.date.accessioned2007-04-23T17:32:34Z
dc.date.available2007-04-23T17:32:34Z
dc.date.issued1988-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-913en_US
dc.identifier.urihttps://hdl.handle.net/1813/6753
dc.description.abstractIn this paper, we establish that fair merge is a powerful non-deterministic primitive that cannot be implemented in terms of other well-known primitives. It is well known that fair merge embodies countable non-determinism. It is also been known that McCarthy's amb embodies countable non-determinism. It had not been known, however, whether amb could implement a fair merge. We show that countable non-determinism together with angelic non-determinism cannot implement fair merge even in dynamic dataflow networks. This settles a question posed by Abramsky over four years ago. Earlier work had suggested this result by showing that for static dataflow networks, one cannot implement fair merge using angelic merge.en_US
dc.format.extent1865896 bytes
dc.format.extent476826 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleMcCarthy's Amb Cannot Implement Fair Mergeen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics