dc.contributor.author |
Calude, E |
en |
dc.contributor.author |
Mills, B |
en |
dc.contributor.author |
Mills, L |
en |
dc.date.accessioned |
2009-04-16T23:17:39Z |
en |
dc.date.available |
2009-04-16T23:17:39Z |
en |
dc.date.issued |
2003-06 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-221 (2003) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3728 |
en |
dc.description.abstract |
Studies of computational complementarity properties in finite state interactive
automata may shed light on the nature of both quantum and classical computation.
But, complementarity is difficult to test even for small-size automata. This paper
introduces the concept of an observation graph of an automaton which is used as
the main tool for the design of an algorithm which tests, in a uniform manner, two
types of complementarity properties. Implementations have been run on a standard
desktop computer examining all 5-state binary automata. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial |
en |
dc.title |
A Uniform Method for Testing Computational Complementarity |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |