Computational Complexity in Non-Turing Models of Computation (2011)

First Author: Blakey E
Attributed to:  Complexity and Decidability in Unconventional Computational Models funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.entcs.2011.01.003

Publication URI: http://dx.doi.org/10.1016/j.entcs.2011.01.003

Type: Journal Article/Review

Parent Publication: Electronic Notes in Theoretical Computer Science

Issue: 1