Universal field machine that computes beyond the Turing limit

MaRDI QIDQ5321462zbMATH OpenFDO

Authors Julian Martin Fernandez

Publication date 22 July 2009

Mathematics Subject Classification ID

Topological dynamics (37B99) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Analog computation beyond the Turing limit
• X-machines and the halting problem: Building a super-turing machine
• scientific article; zbMATH DE number 497572
• Physical computation. A mechanistic account
• Hypercomputation and the Physical Church‐Turing Thesis

Cited in

(2)

• Unconventional “Stateless” Turing–Like Machines
• Universal neural field computation

This page was built for publication: Universal field machine that computes beyond the Turing limit

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