On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism

DOI10.1007/978-3-319-46376-6_4zbMath1396.68043OpenAlexW2398387714MaRDI QIDQ4686646

Selim G. Akl, Nancy Salay

Publication date: 4 October 2018

Published in: Emergent Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-46376-6_4

zbMATH Keywords

Turing machineEREW PRAMrandom access machineparallel random access machineuniversality principle

Mathematics Subject Classification ID

Related Items (1)

From Parallelism to Nonuniversality: An Unconventional Trajectory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Superlinear performance in real-time parallel computation
• X-machines and the halting problem: Building a super-turing machine
• Parallel computation and measurement uncertainty in nonlinear dynamical systems
• Computations with Uncertain Time Constraints: Effects on Parallelism and Universality
• Super-Recursive Algorithms
• Quantum computing: beyond the limits of conventional computation†
• Hypercomputation
• Building Infinite Machines
• Handbook of Parallel Computing
• Accelerating machines: a review
• Unconventional Computation
• New Computational Paradigms
• Non-Turing computations via Malament--Hogarth space-times

This page was built for publication: On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism