How to build a hypercomputer

DOI10.1016/j.amc.2009.04.049zbMath1192.68269OpenAlexW2088921079MaRDI QIDQ1036529

Newton C. A. Da Costa, Francisco Antonio Doria

Publication date: 13 November 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.04.049

zbMATH Keywords

Turing machineshypercomputationhypercomputer

Mathematics Subject Classification ID

Cites Work

• Informal versus formal mathematics
• Undecidability and incompleteness in classical mechanics
• On the metamathematics of the P vs. NP question
• Some thoughts on hypercomputation
• Hilbert's Tenth Problem is Unsolvable
• Transfinite Progressions: A Second Look at Completeness
• Some undecidable problems involving elementary functions of a real variable
• Transfinite recursive progressions of axiomatic theories
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Systems of Logic Based on Ordinals^†
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How to build a hypercomputer