Trial and error predicates and the solution to a problem of Mostowski

Cited in

(93)

The Kleene Hierarchy Classification of Recursively Random Sequences
Minimal numerations of positively computable families
What is the Church-Turing Thesis?
Infima in the d.r.e. degrees
Epistemic entrenchment and arithmetical hierarchy
Models of noncontradictory formulas and the Ershov hierarchy
Bounded query classes and the difference hierarchy
Toward a theory of intelligence
Comments on some theories of fuzzy computation
The myth of `the myth of hypercomputation'
Trial and error mathematics. I: Dialectical and quasidialectical systems
Positive enumerations
Recognizing strong random reals
A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
Computation as an unbounded process
A survey of results on the d.c.e. and \(n\)-c.e. degrees
Uniform density in Lindenbaum algebras
Learning algebraic structures with the help of Borel equivalence relations
Calculating the mind change complexity of learning algebraic structures
scientific article; zbMATH DE number 3503215 (Why is no real title available?)
Causal learning with Occam's razor
Theory choice, theory change, and inductive truth-conduciveness
On the possibility of inference to the best explanation
On the solvability of inductive problems: a study in epistemic topology
Self-reference and incompleteness in a non-monotonic setting
Putnam's theorem on the complexity of models
The d.r.e. degrees are not dense
Satisfying predicates: Kleene's proof of the Hilbert-Bernays theorem
A new Gödelian argument for hypercomputing minds based on the busy beaver problem
Experience, generations, and limits in machine learning
The concept of computability
Uncomputability: The problem of induction internalized
Elementary theories and structural properties of d-c.e. and n-c.e. degrees
Infinitary self-reference in learning theory
Fine hierarchies and m-reducibilities in theoretical computer science
Learning theory and epistemology
Ockham's razor, empirical complexity, and truth-finding efficiency
A classification of low c.e. sets and the Ershov hierarchy
A logic for trial and error classifiers
The undecidability of propositional adaptive logic
Logic and probabilistic systems
Fixed-parameter decidability: extending parameterized complexity analysis
Revising type-2 computation and degrees of discontinuity
On the quantifier of limiting realizability
Hypercomputation: Philosophical issues
Turing computability: structural theory
Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
The interpretation existence lemma
Limiting characterizations of low level space complexity classes
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
Finitely bounded effective computability
The modal argument for hypercomputing minds
Homogeneous 0'-elements in structural partial orderings
Experimental logics and ^0_2-theories
A survey of results on the d-c.e. and n-c.e. degrees
INTERLEAVING LOGIC AND COUNTING
On learning for families of algebraic structures
Special splitting in the 2-c.e. Turing degrees
Turing oracle machines, online computing, and three displacements in computability theory
Interpolating \(d\)-r.e. and REA degrees between r.e. degrees
Bounded queries to SAT and the Boolean hierarchy
Significato e verita nell'aritmetica peaniana
Modes of convergence to the truth: steps toward a better epistemology of induction
On cardinality of semilattices of enumerations of nondiscrete families
Zeno machines and hypercomputation
On learning families of ideals in lattices and Boolean algebras
Extending and interpreting Post's programme
The logic of reliable and efficient inquiry
There exists a maximal 3-c.e. enumeration degree
Mind change optimal learning of Bayes net structure from dependency and independency data
Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy
The co-discovery of conservation laws and particle families
Computable categoricity and the Ershov hierarchy
On the danger of half-truths
Is Gold-Putnam diagonalization complete?
Truth-conditional cognitivism and the lexical problem
Optimality justifications and the optimality principle: new tools for foundation-theoretic epistemology
Nondensity of Double Bubbles in the D.C.E. Degrees
A Natural Axiomatization of Computability and Proof of Church's Thesis
How to reason defeasibly
HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
On learning down-sets in quasi-orders, and ideals in Boolean algebras
On TAE machines and their computational power
The case for hypercomputation
Cellular automata are generic
Notes on naive semantics
The many forms of hypercomputation
Difference randomness
On frequency-enumerable sets
Generalization of Shapiro's theorem to higher arities and noninjective notations
Realism, rhetoric, and reliability
Convergence of preference functions
INCOMPLETENESS VIA PARADOX AND COMPLETENESS

This page was built for publication: Trial and error predicates and the solution to a problem of Mostowski

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