A uniform approach to test computational complementarity

Authors:
Elena Calude;Bruce Mills;Lan Mills
Affiliations:
Institute for Information and Mathematical Sciences, Massey University at Albany, Private Bag 102904, NSMC, Auckland, New Zealand;Institute for Information and Mathematical Sciences, Massey University at Albany, Private Bag 102904, NSMC, Auckland, New Zealand;Institute for Information and Mathematical Sciences, Massey University at Albany, Private Bag 102904, NSMC, Auckland, New Zealand
Venue:
Acta Cybernetica
Year:
2004

Citing 3
Cited 0

On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine

Journal of the ACM (JACM)
Closed Partition Lattice and Machine Decomposition

IEEE Transactions on Computers - Special issue on fault-tolerant embedded systems
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Quantified Score

Hi-index	0.00

Visualization

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.