A note on accelerated Turing machines
From MaRDI portal
Recommendations
Cites work
- -computations on Turing machines
- \(X\)-automata on \(\omega\)-words
- Decision problems forω-automata
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 1869997 (Why is no real title available?)
- Non-Turing computations via Malament--Hogarth space-times
- Rekursive Folgenmengen I
- Super-tasks, accelerating Turing machines and uncomputability
- The infinite book. A short guide to the boundless, timeless, and endless
- Zeno machines and hypercomputation
Cited in
(11)- Super-tasks, accelerating Turing machines and uncomputability
- Supertasks do not increase computational power
- Membrane system models for super-Turing paradigms
- Some transfinite generalisations of Gödel's incompleteness theorem
- Going beyond Turing with P automata: partial adult halting and regular observer -languages
- A flexiformal model of knowledge dissemination and aggregation in mathematics
- scientific article; zbMATH DE number 1189126 (Why is no real title available?)
- scientific article; zbMATH DE number 1869997 (Why is no real title available?)
- Accelerating machines: a review
- Output concepts for accelerated Turing machines
- A note on alternating on-line Turing machines
This page was built for publication: A note on accelerated Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3061156)
