On computable numbers, nonuniversality, and the genuine power of parallelism
From MaRDI portal
Publication:4686646
DOI10.1007/978-3-319-46376-6_4zbMATH Open1396.68043OpenAlexW2398387714MaRDI QIDQ4686646FDOQ4686646
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
Recommendations
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Non-Turing computations via Malament--Hogarth space-times
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypercomputation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Building Infinite Machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Superlinear performance in real-time parallel computation
- X-machines and the halting problem: Building a super-turing machine
- Super-Recursive Algorithms
- Title not available (Why is that?)
- New Computational Paradigms
- Accelerating machines: a review
- Parallel computation and measurement uncertainty in nonlinear dynamical systems
- Computations with Uncertain Time Constraints: Effects on Parallelism and Universality
- Unconventional Computation
- Quantum computing: beyond the limits of conventional computation†
- Handbook of Parallel Computing
Cited In (3)
This page was built for publication: On computable numbers, nonuniversality, and the genuine power of parallelism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4686646)