On Computable Numbers, with an Application to the Entscheidungsproblem

Cited in

(only showing first 100 items - show all)

A computable version of Banach's inverse mapping theorem
Gödel incompleteness and the Black hole information paradox
Classification of computably approximable real numbers
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
The road to two theorems of logic
Emergence as a computability-theoretic phenomenon
How to build a hypercomputer
Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
Automated theorem proving methods
Model-theoretic and algorithmic questions in group theory
A note on Parikh maps, abstract languages, and decision problems
On effectively computable realizations of choice functions
Living with a new mathematical species
Introduction to the concept of recursiveness of fuzzy functions
A universal machine without change of state
Representations of the real numbers and of the open subsets of the set of real numbers
Incompleteness theorems for random reals
Lower bounds on degrees of game-theoretic structures
An infinite version of Arrow's theorem in the effective setting
Random problems
Physics of selective systems: Computation and biology
Computational complexity of real functions
On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
Logic, ontology, mathematical practice
Finite automata with multiplication
``V-tape, a virtual memory oriented data type, and its resource requirements
Anomalies of self-description
The miraculous universal distribution
A domain-theoretic approach to computability on the real line
Markov's constructive analysis; a participant's view
What is computation?
On Alan Turing's anticipation of connectionism
Searle's abstract argument against strong AI
Weights for total division orderings on strings
Somewhat finite approaches to infinite sentences.
DNA computing: Arrival of biological mathematics
Using macrotransducers to specify partial continuous operators in metric spaces
Direct constructions of universal extended H systems.
The generalized universal law of generalization.
A blend of methods of recursion theory and topology.
On the hierarchy and extension of monotonically computable real numbers.
Computability on subsets of metric spaces.
Toward a theory of intelligence
Super-tasks, accelerating Turing machines and uncomputability
The modal argument for hypercomputing minds
Frontier between decidability and undecidability: A survey
The Turing closure of an Archimedean field
On Turing's Turing Test and why the matter matters
Computationalism
A manifesto for the computational method
Real number computation through Gray code embedding.
Physical quantum algorithms
Informed generation: physical origin and biological evolution of genetic codescript interpreters
Computation as social agency: what, how and who
Open problems in universal induction \& intelligence
Simulation of Turing machine with uEAC-computable functions
The never-ending recursion
An automaton group with undecidable order and Engel problems
On the information carried by programs about the objects they compute
``Viral Turing machines, computation from noise and combinatorial hierarchies
Reducibility of computable metrics on the real line
Semicomputable manifolds in computable topological spaces
Closure to efficient causation, computability and artificial life
Second-order propositional modal logic: expressiveness and completeness results
Unconventional complexity measures for unconventional computers
A blend of methods of recursion theory and topology: a _1⁰ tree of shadow points
Complexity of the calculus of continued fraction representation of real numbers
Nonalgorithmic discrete procedures
Organization of computations on the atomic-molecular level
Consciousness: Computing the uncomputable
Definability, decidability, complexity
On the expressiveness of choice quantification
On the complexity of decision using destinies in \(H\)-bounded structures
Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
Informational properties of neural nets performing algorithmic and logical tasks
Does indirect addressing matter?
Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
An abstract data type for real numbers
Tiling problems and undecidability in the cluster variation method.
Physical complexity of symbolic sequences
Building a model of a useful Turing machine
On the time complexity of partial real functions
The complexity of module radicals
Is there any real substance to the claims for a ``new computationalism?
Computability, noncomputability, and hyperbolic systems
Computing spectral measures and spectral types
Shannon entropy rate of hidden Markov processes
Computability of products of chainable continua
Dense computability structures
Putnam's diagonal argument and the impossibility of a universal learning machine
Computing absolutely normal numbers in nearly linear time
Counting nondeterministic computations
A thesis for interaction
On the computability of the set of automorphisms of the unit square
Detectability of labeled weighted automata over monoids
Synthesizing ranking functions for loop programs via SVM
Effective compactness and orbits of points under the isometry group
Quantitative coding and complexity theory of compact metric spaces
Effective notions of weak convergence of measures on the real line
Communities and ancestors associated with Egon Börger and ASM

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)