The Turing machine paradigm in contemporary computing
From MaRDI portal
Recommendations
Cited in
(21)- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
- Autopoietic automata: complexity issues in offspring-producing evolving processes
- Definability as hypercomputational effect
- Relativistic computers and the Turing barrier
- On the impact of Turing machines
- Turing Machine-Inspired Computer Science Results
- Nanomachine Computing by Quorum Sensing
- On the executability of interactive computation
- How We Think of Computing Today
- On the computing paradigm and computational complexity
- Computation as an unbounded process
- On computable numbers, nonuniversality, and the genuine power of parallelism
- Pipelined Decomposable BSP Computers
- Turing machines, transition systems, and interaction
- The machine as data: a computational view of emergence and definability
- The Turing o-machine and the DIME network architecture: injecting the architectural resiliency into distributed computing
- Large language models and the extended Church-Turing thesis
- Turing machines, transition systems, and interaction
- General relativistic hypercomputing and foundation of mathematics
- A broader view on the limitations of information processing and communication by nature
This page was built for publication: The Turing machine paradigm in contemporary computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762165)
