Computation as an unbounded process
From MaRDI portal
Publication:418791
DOI10.1016/J.TCS.2011.12.040zbMATH Open1279.68089OpenAlexW2024920805MaRDI QIDQ418791FDOQ418791
Authors: J. Van Leeuwen, Jiří Wiedermann 
Publication date: 30 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.040
Recommendations
- Computational processes and incompleteness
- Turing Unbound: Transfinite Computation
- Computing with infinitely many processes
- scientific article; zbMATH DE number 6426780
- scientific article; zbMATH DE number 1909825
- Reasoning about infinite computations
- The nature of computation
- scientific article; zbMATH DE number 4154423
- Limits of computation. From a programming perspective
- Computation and its limits.
nondeterminismarithmetical hierarchyhypercomputationmind change complexityrelativistic computationunbounded computation
Cites Work
- Deciding Arithmetic Using SAD Computers
- Title not available (Why is that?)
- Non-Turing computations via Malament--Hogarth space-times
- Title not available (Why is that?)
- Language identification in the limit
- Alternation
- Computational Complexity
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Title not available (Why is that?)
- Trial and error predicates and the solution to a problem of Mostowski
- \(\omega\)-computations on Turing machines
- Title not available (Why is that?)
- The Extent of Computation in Malament–Hogarth Spacetimes
- Limiting recursion
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Arithmetical hierarchy and complexity of computation
- Zeno machines and hypercomputation
- Title not available (Why is that?)
- Iterated Limiting Recursion and the Program Minimization Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinite time Turing machines
- Infinite Computations and a Hierarchy in Δ 3
- Systems of Logic Based on Ordinals†
- Recursive Predicates and Quantifiers
Cited In (9)
- P colonies. Survey
- Trial and error mathematics. I: Dialectical and quasidialectical systems
- Going beyond Turing with P automata: partial adult halting and regular observer \(\omega\)-languages
- A connection between red-green Turing machines and Watson-Crick T0L systems
- Variants of P systems with activation and blocking of rules
- Title not available (Why is that?)
- Extended spiking neural P systems with white hole rules and their red-green variants
- Circular interval-valued computers and simulation of (red-green) Turing machines
- Title not available (Why is that?)
This page was built for publication: Computation as an unbounded process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418791)
