Output concepts for accelerated Turing machines

DOI10.1007/S11047-010-9197-XzbMath1206.68119OpenAlexW2083602672MaRDI QIDQ609032

Petrus H. Potgieter, Elemer E. Rosinger

Publication date: 30 November 2010

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-010-9197-x

zbMATH Keywords

accelerated Turing machinenon-standard output conceptsThomson's lampultrafilter accepting computationsZeno machine

Mathematics Subject Classification ID

Related Items (1)

Supertasks do not increase computational power

Cites Work

• Unnamed Item
• Nonstandard methods in combinatorics and theoretical computer science
• A complete logic for reasoning about programs via nonstandard model theory. I
• A complete logic for reasoning about programs via nonstandard model theory. II
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Why there is no such discipline as hypercomputation
• The many forms of hypercomputation
• Infinite Time Turing Machines With Only One Tape
• A note on accelerated Turing machines
• Ultrafilters: Some old and some new results
• Hypercomputation and the Physical Church‐Turing Thesis
• Infinite time Turing machines

This page was built for publication: Output concepts for accelerated Turing machines