A uniform approach to test computational complementarity

Calude Elena and Mills Bruce and Mills Lan: A uniform approach to test computational complementarity. In: Acta cybernetica, (16) 3. pp. 367-384. (2004)

[thumbnail of Calude_2004_ActaCybernetica.pdf]
Cikk, tanulmány, mű

Download (163kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2004
Volume: 16
Number: 3
ISSN: 0324-721X
Page Range: pp. 367-384
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38517/
Uncontrolled Keywords: Számítástechnika, Nyelvészet - számítógép alkalmazása
Additional Information: Bibliogr.: p. 383-384. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
06. Humanities
06. Humanities > 06.02. Languages and Literature
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 15. 10:00
URI: http://acta.bibl.u-szeged.hu/id/eprint/12728

Actions (login required)

View Item View Item