New Models of Computation

DOI10.1093/COMJNL/47.1.4MaRDI QIDQ4828442zbMATH OpenOpenAlexFDO

Authors Peter Wegner, Eugene Eberbach

Publication date 19 November 2004

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/47.1.4

Mathematics Subject Classification ID

Recommendations

• Logical Approaches to Computational Barriers
• Natural computation and non-Turing models of computation
• The simple dynamics of super Turing theories
• scientific article; zbMATH DE number 1909819
• X-machines and the halting problem: Building a super-turing machine

Cited in

(13)

• Logical Approaches to Computational Barriers
• scientific article; zbMATH DE number 1900795 (Why is no real title available?)
• A natural generalization of the Turing computability model
• Welcoming the super Turing theories
• Approximate reasoning in the algebra of bounded rational agents
• Thirty years of collaboration with Jan van Leeuwen: in search of understanding computation
• Physical constraints on hypercomputation
• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• Super-Recursive Algorithms
• scientific article; zbMATH DE number 1338259 (Why is no real title available?)
• A new spectrum of computable models
• On TAE machines and their computational power
• New directions in computational modelling

This page was built for publication: New Models of Computation

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