On Computable Numbers, with an Application to the Entscheidungsproblem

Cited in

(only showing first 100 items - show all)

Why Turing’s Thesis Is Not a Thesis
A formal approach to the problem of logical non-omniscience
Hierarchy of Computably Enumerable Degrees II
Physical complexity of symbolic sequences
Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
Reduction among bracket polynomials
Turing-Complete Subclasses of CHR
New degree spectra of Polish spaces
Computability of Real Numbers
Unimodular completion of polynomial matrices
Contributions to the reduction theory of the decision problem
Communities and ancestors associated with Egon Börger and ASM
Représentations des nombres réels par développements en base entière et complexité. (Representations of real numbers by expansions on integer basis and complexity)
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
Constructing fewer open cells by GCD computation in CAD projection
Reactive Turing machines
``V-tape, a virtual memory oriented data type, and its resource requirements
Reachability games and friends: a journey through the Lens of memory and complexity (invited talk)
Mathematical developments of the incompleteness theorems
Continuous and monotone machines
Galilean resonances: the role of experiment in Turing’s construction of machine intelligence
Mass problems associated with effectively closed sets
Online order basis algorithm and its impact on the block Wiedemann algorithm
Exploring transient neurophysiological states through local and time-varying measures of information dynamics
Economic Dynamics and Computation—Resurrecting the Icarus Tradition
Dynamical Systems Theory and Algorithms for NP-hard Problems
All-Termination(T)
Symbolism and enactivism: an experimental test of conflicting approaches to artificial intelligence
Philosophy, engineering, biology, and history: a vindication of Turing's views about the distinction between the cognitive and physical sciences
The myth of the Turing machine: the failings of functionalism and related theses
Church’s thesis and its relation to the concept of realizability in biology and physics
Effective compactness and orbits of points under the isometry group
Probabilistic Turing Machines and Computability
Time-efficient read/write register in crash-prone asynchronous message-passing systems
Maximum likelihood geometry in the presence of data zeros
Turing machines, transition systems, and interaction
Semantics-to-Syntax Analyses of Algorithms
The laterality problem for non-erasing Turing machines on \lbrace 0,1\rbrace is completely solved
Meanings of model checking
Concrete digital computation: what does it take for a physical system to compute?
Anomalies of self-description
On the hierarchy and extension of monotonically computable real numbers.
Computable approximations of a chainable continuum with a computable endpoint
Toward a theory of intelligence
A universal machine without change of state
Statistical properties of dynamical systems -- Simulation and abstract computation
On weak growing context-sensitive grammars
A manifesto for the computational method
On the computation of geometric features of spectra of linear operators on Hilbert spaces
Prediction of Recursive Real-Valued Functions from Finite Examples
Fair play for machines
Evaluating parametric holonomic sequences using rectangular splitting
Fuzzy simplification of non-numeric expressions containing some intervals and/or floating point numbers
High performance implementation of the TFT
Solving higher order linear differential equations having elliptic function coefficients
Sparse polynomial interpolation codes and their decoding beyond half the minimum distance
The asymptotic analysis of some interpolated nonlinear recurrence relations
The generalized universal law of generalization.
Direct constructions of universal extended H systems.
Mathematical programming: Turing completeness and applications to software analysis
Disentangling complexity from randomness and chaos
Life as thermodynamic evidence of algorithmic structure in natural environments
Physical portrayal of computational complexity
NMR quantum computing
When series of computable functions with varying domains are computable
The Legacy of Turing in Numerical Analysis
Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
Graph automata: Natural expression of self-reproduction
The MMO problem
Effective notions of weak convergence of measures on the real line
Formalism and intuition in computability
On the uncountability of \(\mathbb{R}\)
The developments of the concept of machine computability from 1936 to the 1960s
Linear independence oracles and applications to rectangular and low rank linear systems
Investigations on the approximability and computability of the Hilbert transform with applications
Computing necessary integrability conditions for planar parametrized homogeneous potentials
Equivariant lattice generators and Markov bases
Computational complexity of real functions
Encodings of Turing machines in linear logic
Characterisation of the set of ground states of uniformly chaotic finite-range lattice models
(In)efficiency and reasonable cost models
Formalizing abstract computability: Turing categories in Coq
A natural generalization of the Turing computability model
Introduction to the concept of recursiveness of fuzzy functions
Representations of the real numbers and of the open subsets of the set of real numbers
On the expressiveness of choice quantification
Computational power of infinite quantum parallelism
Informed generation: physical origin and biological evolution of genetic codescript interpreters
Small universal devices
Turing-machines and the Entscheidungsproblem
ARITHMETIC IN THE FORM
Bridging the gap between neurons and cognition through assemblies of neurons
Radical anti-realism, Wittgenstein and the length of proofs
An RNA-based theory of natural universal computation
A computational definition of financial randomness
A fast algorithm for computing the characteristic polynomial of the \(p\)-curvature
Computation as an unbounded process
Arbitrary arrow update logic with common knowledge is neither RE nor co-RE
Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
What is the natural abstraction level of an algorithm?

This page was built for publication: On Computable Numbers, with an Application to the Entscheidungsproblem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5765445)