scientific article; zbMATH DE number 7384882

zbMath1467.68055arXiv1702.05547MaRDI QIDQ5010155

Benjamin Hellouin de Menibus, Anahí Gajardo, Diego Maldonado, Andrés Moreir

Publication date: 24 August 2021

Full work available at URL: https://arxiv.org/abs/1702.05547

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other nonclassical models of computation (68Q09)

Related Items (1)

A physically universal Turing machine

Cites Work

• P-completeness of Cellular Automaton Rule 110
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: