Cellular Automata are Generic

Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular automaton with unconstrained topology and with the power to create new cells. The advantage is that the latter is closer to physical reality. The overhead of our simulation is quadratic.Comment: In Proceedings DCM 2014, arXiv:1504.0192

Electron Viscosity, Current Vortices and Negative Nonlocal Resistance in Graphene

Quantum-critical states of diverse strongly correlated systems are predicted to feature universal collision-dominated transport resembling that of viscous fluids. However, investigation of these phenomena has been hampered by the lack of known macroscopic signatures of the hydrodynamic regime at criticality. Here we identify vorticity as such a signature and link it with an easily verifiable striking macroscopic transport behavior. Produced by the viscous flow, vorticity can drive electric current against an applied field, resulting in a negative nonlocal voltage. We argue that the latter may play the same role for the viscous regime as zero electrical resistance does for superconductivity. Besides offering a diagnostic of viscous transport which distinguishes it from ohmic currents, the sign-changing electrical response affords a robust tool for directly measuring the viscosity-to-resistivity ratio. The strongly interacting electron-hole plasma in high-mobility graphene provides a bridge between quantum-criticality and the wealth of fluid mechanics phenomena.Comment: submitted for publication, July 201