Physical Computation, P/poly and P/log*
In this paper we give a framework for describing how abstract systems can be used to compute if no randomness or error is involved. Using this we describe a class of classical "physical" computation systems whose computational capabilities in polynomial time are equivalent to P/poly. We th...
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Artikel |
| Språk: | English |
| Publicerad: |
Open Publishing Association
2016-06-01
|
| Serie: | Electronic Proceedings in Theoretical Computer Science |
| Länkar: | http://arxiv.org/pdf/1606.06803v1 |