Computational tractability -- beyond Turing?

DOI10.1142/9789814719063_0002MaRDI QIDQ2800259zbMATH OpenOpenAlexFDO

Authors Peter Marcer, Peter Rowlands

Publication date 15 April 2016

Published in Unified Field Mechanics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814719063_0002

zbMATH Keywords

Lie groupsnilpotent computational universal rewrite systemself-organizationtractability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Quantum computation (81P68)

Recommendations

• scientific article; zbMATH DE number 1759502
• On the computing paradigm and computational complexity
• scientific article; zbMATH DE number 1406123
• A computational complexity theory in membrane computing
• Computational complexity theory and the philosophy of mathematics

Cited in

(3)

• scientific article; zbMATH DE number 1759502 (Why is no real title available?)
• How Redundant Is Your Universal Computation Device?
• Is computational complexity a barrier to manipulation?

This page was built for publication: Computational tractability -- beyond Turing?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800259)