Baumeler, Ämin Wolf, Stefan 2017-07-02 Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a novel computing paradigm beyond quantum computing, replacing this assumption by mere logical consistency: We study non-causal circuits, where a fixed time structure within a gate is locally assumed whilst the global causal structure between the gates is dropped. We present examples of logically consistent non-causal circuits outperforming all causal ones; they imply that suppressing loops entirely is more restrictive than just avoiding the contradictions they can give rise to. That fact is already known for correlations as well as for communication, and we here extend it to computation. application/pdf https://susi.usi.ch/global/documents/319039 https://localhost:5000/ark:/12658/srd1319039 https://susi.usi.ch/documents/319039/files/Baumeler_E_2017.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.3390/e19070326 info:eu-repo/semantics/altIdentifier/ark/12658/srd1319039 info:eu-repo/semantics/openAccess CC BY Entropy. - 2017, vol. 19, no. 7, p. 326-334 Physical computing models Complexity classes Causality info:eu-repo/classification/udc/004 Non-causal computation http://purl.org/coar/resource_type/c_6501