How Redundant Is Your Universal Computation Device?
From MaRDI portal
Recommendations
- Is universal computation a myth?
- What is a universal computing machine?
- What Universal Turing Machines Might Tell Us
- Clockwork Rebooted: Is the Universe a Computer?
- Toward a viable, self-reproducing universal computer
- Are There Traces of Megacomputing in Our Universe
- Computational tractability -- beyond Turing?
- Computability and Complexity of Unconventional Computing Devices
Cites work
- Computing with membranes
- Computing with Spiking Neural P Systems: Traces and Small Universal Systems
- Four Small Universal Turing Machines
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 3813599 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 1138300 (Why is no real title available?)
- scientific article; zbMATH DE number 1746682 (Why is no real title available?)
- scientific article; zbMATH DE number 2087234 (Why is no real title available?)
- scientific article; zbMATH DE number 3305022 (Why is no real title available?)
- Machines, Computations, and Universality
- Membrane Computing
- On small universal antiport P systems
- Small deterministic Turing machines
- Small fast universal Turing machines
- Small Semi-weakly Universal Turing Machines
- Small universal register machines
- Small universal Turing machines
- Spiking neural P systems
- Universality in elementary cellular automata
This page was built for publication: How Redundant Is Your Universal Computation Device?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5191172)
