Output concepts for accelerated Turing machines
From MaRDI portal
Publication:609032
accelerated Turing machinenon-standard output conceptsThomson's lampultrafilter accepting computationsZeno machine
Recommendations
- scientific article; zbMATH DE number 1869997
- A note on accelerated Turing machines
- Output compression, MPC, and iO for Turing machines
- Fast Simulation of Turing Machines by Random Access Machines
- Tools and Algorithms for the Construction and Analysis of Systems
- scientific article; zbMATH DE number 641702
- A hierarchy of fast reversible Turing machines
- Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape
- scientific article; zbMATH DE number 1773073
- On TAE machines and their computational power
Cites work
- scientific article; zbMATH DE number 5234254 (Why is no real title available?)
- A complete logic for reasoning about programs via nonstandard model theory. I
- A complete logic for reasoning about programs via nonstandard model theory. II
- A note on accelerated Turing machines
- Hypercomputation and the Physical Church‐Turing Thesis
- Infinite time Turing machines
- Infinite time Turing machines with only one tape
- Nonstandard methods in combinatorics and theoretical computer science
- The many forms of hypercomputation
- Theory of -languages. I: Characterizations of -context- free languages
- Ultrafilters: Some old and some new results
- Why there is no such discipline as hypercomputation
Cited in
(4)
This page was built for publication: Output concepts for accelerated Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609032)
