Comparing Computational Power

DOI10.1093/jigpal/jzl003zbMath1152.03031arXivcs/0510069OpenAlexW1964306813MaRDI QIDQ3424114

Nachum Dershowitz, Udi Boker

Publication date: 15 February 2007

Published in: Logic Journal of IGPL (Search for Journal in Brave)

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

zbMATH Keywords

simulationcomputational powercomputational modelshypercomputation

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items (8)

What is the Church-Turing Thesis? ⋮ Honest universality ⋮ An RNA-based theory of natural universal computation ⋮ Honest Computability and Complexity ⋮ Three Paths to Effectiveness ⋮ A hypercomputational alien ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis

This page was built for publication: Comparing Computational Power