Various aspects of finite quantum automata (extended abstract)

16Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Determining the birth date of computer science is a very complicated task and certainly reliant to the standpoint chosen. Some may point out the work of Kurt Gödel [18], Alan Turing [31], and Alonso Church [11], thus locating the appearance of computer science to 1930's. Some want to mention Charles Babbage's engines, some Gottfried Leibniz' Calculus Ratiocinator, and some refer back to the Euclidean algorithm. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hirvensalo, M. (2008). Various aspects of finite quantum automata (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5257 LNCS, pp. 21–33). https://doi.org/10.1007/978-3-540-85780-8_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free