Algorithmically random series

Cites work

scientific article; zbMATH DE number 2184445 (Why is no real title available?)
scientific article; zbMATH DE number 3139051 (Why is no real title available?)
scientific article; zbMATH DE number 5695342 (Why is no real title available?)
scientific article; zbMATH DE number 3825806 (Why is no real title available?)
scientific article; zbMATH DE number 3916267 (Why is no real title available?)
scientific article; zbMATH DE number 3932417 (Why is no real title available?)
scientific article; zbMATH DE number 3984596 (Why is no real title available?)
scientific article; zbMATH DE number 4068863 (Why is no real title available?)
scientific article; zbMATH DE number 4091484 (Why is no real title available?)
scientific article; zbMATH DE number 3664922 (Why is no real title available?)
scientific article; zbMATH DE number 3700811 (Why is no real title available?)
scientific article; zbMATH DE number 3706504 (Why is no real title available?)
scientific article; zbMATH DE number 3792154 (Why is no real title available?)
scientific article; zbMATH DE number 19039 (Why is no real title available?)
scientific article; zbMATH DE number 42114 (Why is no real title available?)
scientific article; zbMATH DE number 3497860 (Why is no real title available?)
scientific article; zbMATH DE number 3539202 (Why is no real title available?)
scientific article; zbMATH DE number 3550851 (Why is no real title available?)
scientific article; zbMATH DE number 3554471 (Why is no real title available?)
scientific article; zbMATH DE number 3574077 (Why is no real title available?)
scientific article; zbMATH DE number 3614784 (Why is no real title available?)
scientific article; zbMATH DE number 408780 (Why is no real title available?)
scientific article; zbMATH DE number 1201510 (Why is no real title available?)
scientific article; zbMATH DE number 1226875 (Why is no real title available?)
scientific article; zbMATH DE number 517033 (Why is no real title available?)
scientific article; zbMATH DE number 626734 (Why is no real title available?)
scientific article; zbMATH DE number 722611 (Why is no real title available?)
scientific article; zbMATH DE number 2047478 (Why is no real title available?)
scientific article; zbMATH DE number 1460545 (Why is no real title available?)
scientific article; zbMATH DE number 194764 (Why is no real title available?)
scientific article; zbMATH DE number 1840601 (Why is no real title available?)
scientific article; zbMATH DE number 763370 (Why is no real title available?)
scientific article; zbMATH DE number 794186 (Why is no real title available?)
scientific article; zbMATH DE number 841094 (Why is no real title available?)
scientific article; zbMATH DE number 1420784 (Why is no real title available?)
scientific article; zbMATH DE number 1420837 (Why is no real title available?)
scientific article; zbMATH DE number 1450824 (Why is no real title available?)
scientific article; zbMATH DE number 6307933 (Why is no real title available?)
scientific article; zbMATH DE number 6423784 (Why is no real title available?)
scientific article; zbMATH DE number 7199593 (Why is no real title available?)
scientific article; zbMATH DE number 969633 (Why is no real title available?)
scientific article; zbMATH DE number 5224002 (Why is no real title available?)
scientific article; zbMATH DE number 3275577 (Why is no real title available?)
scientific article; zbMATH DE number 3291134 (Why is no real title available?)
scientific article; zbMATH DE number 3335736 (Why is no real title available?)
scientific article; zbMATH DE number 2247249 (Why is no real title available?)
A Machine-Independent Theory of the Complexity of Recursive Functions
A New Proof that “Krull implies Zorn”
A Note on the Algebraic Closure of a Field
A characterization of non-isometric binary words
A continuity principle, a version of Baire's theorem and a boundedness principle
A course in constructive algebra
A general extension theorem for directed-complete partial orders
A judgmental reconstruction of modal logic
A logical approach to abstract algebra
A map of update constraints in inductive inference
A note on connected reduced rings
A reconstruction of Steel's multiverse project
A sheaf model of the algebraic closure
A solution to Wiehagen's thesis
A theorem of Gilmer and the canonical universal splitting ring
A universal Krull-Lindenbaum theorem
About Goodman's theorem
Algebraische und logistische Untersuchungen über freie Verbände
Algorithmic randomness and complexity.
Algorithmically random series and Brownian motion
An Enhanced Theory of Infinite Time Register Machines
An extension of the Galois theory of Grothendieck
An introduction to Kolmogorov complexity and its applications
Asymptotic number of isometric generalized Fibonacci cubes
Bad pictures: some structural properties related to overlaps
COMPUTABLY COMPACT METRIC SPACES
Calibrating Randomness
Cardinal invariants, non-lowness classes, and Weihrauch reducibility
Cautious limit learning
Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
Checking whether a word is Hamming-isometric in linear time
Classical proofs as programs: how, what and why
Classifying topoi and finite forcing
Coherent randomness tests and computing the \(K\)-trivial sets
Commutative algebra: constructive methods. Finite projective modules. Translated from the French by Tania K. Roblot
Completeness theorems for first-order logic analysed in constructive type theory
Computability and Randomness
Computability and Randomness
Computability and models. Perspectives east and west
Computability of Polish spaces up to homeomorphism
Computability on quasi-Polish spaces
Computable analogs of cardinal characteristics: prediction and rearrangement
Computable structures and the hyperarithmetical hierarchy
Computably Isometric Spaces
Computably enumerable partial orders
Constructive Aspects of Noetherian Rings
Constructive Sheaf Semantics
Constructive commutative algebra. Projective modules over polynomial rings and dynamical Gröbner bases
Continuity and geometric logic
Continuity and nondiscontinuity in constructive mathematics
Continuity properties in constructive mathematics
Criteria of language learning
Cut elimination for entailment relations
Data types à la carte
Decidable Kripke models of intuitionistic theories
Decision times of infinite computations
Degrees of unsolvability of constructible sets of integers
Dependent choice, `quote' and the clock
Der Minimalkalkül, ein reduzierter intuitionistischer Formalismus.
Do Noetherian modules have Noetherian basis functions?
Dynamic evaluation of integrity and the computational content of Krull's lemma
Dynamical method in algebra: Effective Nullstellensätze
Effectivity and reducibility with ordinal Turing machines
Einige Sätze über Reihen von allgemeinen Orthogonalfunktionen.
Eliminating disjunctions by disjunction elimination
Eliminating disjunctions by disjunction elimination
Enumerating classes of effective quasi-Polish spaces
Equivalence relations that are ^0_3 complete for computable reducibility (extended abstract)
Eventually infinite time Turing machine degrees: infinite time decidable reals
Exercises in modules and rings.
Exploring mathematical objects from custom-tailored mathematical universes
Exploring predicativity
Extended bar induction in applicative theories
Fair reactive programming
Five stages of accepting constructive mathematics
Forcing and the universe of sets: must we lose insight?
Forcing for IZF in sheaf toposes
Forcing for hat inductive definitions in arithmetic
Forcing for mathematicians
Forcing in Proof Theory
Forcing in intuitionistic systems without power-set
Formal methods in programming and their applications. International conference, Academgorodok, Novosibirsk, Russia, June 28 - July 2, 1993. Proceedings
Frames and Locales
Fun slot machines and transformations of words avoiding factors
Fundamental concepts of the methodology of the deductive sciences. I.
Generalized Fibonacci cubes
Generalized spaces for constructive algebra
Genericity and randomness with ITTMs
Geometric spaces with no points
Grothendieck Topology as Geometric Modality
Handbook of Spatial Logics
Hidden constructions in abstract algebra. Krull Dimension of distributive lattices and commutative rings
How incomputable is the separable Hahn-Banach theorem?
Hypercubes and isometric words based on swap and mismatch distance
Idealtheorie in Ringen mit Teilkettensatz ohne Endlichkeitsbedingung.
Incremental learning from positive data
Induction in algebra: a first case study
Induction in algebra: a first case study
Inductive inference of automata, functions and programs
Inductive inference of formal languages from positive data
Infinite time Turing machines
Infinite time decidable equivalence relation theory
Isometric words based on swap and mismatch distance
Isomorphism relations on computable structures
Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
Jewels of Stringology
Krivine's intuitionistic proof of classical completeness (for countable languages)
Krull Implies Zorn
La logique de l'infini.
Language identification in the limit
Language learning from texts: Mindchanges, limited memory and monotonicity
Lazy bases: a minimalist constructive theory of Noetherian rings
Learning indexed families of recursive languages from positive data: A survey
Learning languages with decidable hypotheses
Learning strategies
Logic and structure
Logical Approaches to Computational Barriers
Lorenzen's reshaping of Krull's Fundamentalsatz for integral domains (1938--1953)
Making the use of maximal ideals constructive
Mass Problems and Randomness
Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19--24, 2009. Proceedings
Maximal ideals in countable rings, constructively
Minimal prime ideals and arithmetic comprehension
Minimality considerations for ordinal computers modeling constructibility
Monotonic and dual monotonic language learning
Monotonic and non-monotonic inductive inference
Noetherian orders
Nontrivial Uses of Trivial Rings
Normal forms in semantic language identification
On Krull's separation lemma
On \(k\)-ary \(n\)-cubes and isometric words
On computable numbers, with an application to the Entscheidungsproblem. A correction.
On degree spectra of topological spaces
On higher effective descriptive set theory
On random almost periodic trigonometric polynomials and applications to ergodic theory
On some series of functions. I, II.
On some series of functions. III.
On the Cauchy completeness of the constructive Cauchy reals
On the computational content of Zorn's lemma
On the failure of BD-ℕ and BD, and an application to the anti-specker property
On the necessity of some topological spaces
On various negative translations
Optimal language learning from positive data
Ordering groups constructively
Ordinal computability. An introduction to infinitary machines
Ordinal machines and admissible recursion theory
Overt choice
P ≠ NP ∩ co-NP for Infinite Time Turing Machines
Polynomials and radical ideals
Post's problem for supertasks has both positive and negative solutions
Proceedings of the conference in honor of Jean-Pierre Kahane, Orsay, June 28--July 3, 1993
Proofs of two conjectures on generalized Fibonacci cubes
Proper maps of toposes
Prudence and other conditions on formal language learning
Quasi-Polish spaces
Quaternary n-cubes and isometric words
RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
Radical theory of Scott-open filters
Ramsey's Theorem and the Pigeonhole Principle in Intuitionistic Mathematics
Random graphs.
Randomness and differentiability
Randomness on computable probability spaces -- a dynamical point of view
Realisability for infinitary intuitionistic set theory
Realizability. An introduction to its categorical side
Register computations on ordinals
Resolving finite indeterminacy. A definitive constructive universal prime ideal theorem
Results on memory-limited U-shaped learning
Revolutions and revelations in computability. 18th conference on computability in Europe, CiE 2022, Swansea, UK, July 11--15, 2022. Proceedings
Ribenboim's order extension theorem from a constructive point of view
Separating fragments of WLEM, LPO, and MP
Separating the fan theorem and its weakenings
Separating the fan theorem and its weakenings. II
Set-driven and rearrangement-independent learning of recursive languages
Sketches for arithmetic universes
Small \(\Pi^{0}_{1}\) classes
Smooth random functions, random ODEs, and Gaussian processes
Some notes on spaces of ideals and computable topology
Some properties of trigonometric series whose terms have random signs
Space and time complexity for infinite time Turing machines
Space-bounded OTMs and REG ∞
Splitting fields of central simple algebras of exponent two
Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem
Strongly Noetherian rings and constructive ideal theory
Strongly non-U-shaped language learning results by general techniques
Structure of Fibonacci cubes: a survey
Syntax for semantics: Krull's maximal ideal theorem
Systems that learn. An introduction to learning theory for cognitive and computer scientists
THE FIRST-ORDER LOGIC OF CZF IS INTUITIONISTIC FIRST-ORDER LOGIC
Taming Koepke's zoo. II: Register machines
The Ascending Tree Condition: Constructive Algebra Without Countable Choice
The Jacobson radical for an inconsistency predicate
The Peirce translation and the double negation shift
The Power of the Ultrafilter Theorem
The Russell-Prawitz modality
The basic theory of infinite time register machines
The computational significance of Hausdorff's maximal chain principle
The computational strengths of -tape infinite time Turing machines
The consistency of classical set theory relative to a set theory with intu1tionistic logic
The consistency of the axiom of choice and of the generalized continuum-hypothesis.
The definition of random sequences
The isometry degree of a computable copy of ℓ p 1
The nature of computation. Logic, algorithms, applications. 9th conference on computability in Europe, CiE 2013, Milan, Italy, July 1--5, 2013. Proceedings
The next admissible ordinal
The point of pointless topology
The rearrangement number
The set-theoretic multiverse
The structures of bad words
The uses of set theory
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
Topoi. The categorial analysis of logic. Rev. ed
Toposes without points
Toward a mathematical theory of inductive inference
Towards a theory of infinite time Blum-Shub-Smale machines
Towards an atlas of computational learning theory
Towards computable analysis on the generalised real line
Towards the Effective Descriptive Set Theory
Turing Computations On Ordinals
Typed lambda-calculus in classical Zermelo-Fraenkel set theory
U-shaped, iterative, and iterative-with-counter learning
Uncountable Gandy Ordinals
Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique
Variations on Salem-Zygmund results for random trigonometric polynomials: application to almost sure nodal asymptotics
Weihrauch degrees, omniscience principles and weak computability
What is Noetherian?
What is the theory ZFC without power set?
When unlearning helps
Über die Wahrscheinlichkeit dafür, daß der Konvergenzkreis einer Potenzreihe ihre natürliche Grenze ist.

This page was built for publication: Algorithmically random series

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