New Computational Paradigms

DOI10.1007/b136981zbMath1115.68082OpenAlexW2278484831MaRDI QIDQ5717035

Dina Q. Goldin, Peter Wegner

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136981

zbMATH Keywords

persistent Turing machinesformal models of interaction machines

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Turing machines and related notions (03D10) History of computer science (68-03)

Related Items (7)

What is the Church-Turing Thesis? ⋮ Verifying of interface assertions for infinite state Mealy machines ⋮ Definability as hypercomputational effect ⋮ Zeno machines and hypercomputation ⋮ On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism ⋮ Emergence as a computability-theoretic phenomenon ⋮ Computability and realizability for interactive computations

This page was built for publication: New Computational Paradigms