Imagen de Portada

Bishop's (up)crossing inequality and lower semicomputable random reals revisited

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Andreev, Mikhail, Shen, Alexander
Formato:	Preprint
Publicado:	2025
Materias:	Logic Information Theory 68Q45 F.1.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Conditional normality and finite-state dimensions revisited
por: Shen, Alexander
Publicado: (2024)

Commutative N-polyregular functions
por: Lopez, Aliaume
Publicado: (2024)

The Algebra of Nondeterministic Finite Automata
por: Gorrieri, Roberto
Publicado: (2023)

Axiomatizing NFAs Generated by Regular Grammars
por: Gorrieri, Roberto
Publicado: (2024)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
por: Adsul, Bharat, et al.
Publicado: (2024)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
por: Volkov, Mikhail V.
Publicado: (2025)

Learning Closed Signal Flow Graphs
por: Piotrovskaya, Ekaterina, et al.
Publicado: (2024)

Deterministic Suffix-reading Automata
por: Keerthan, R, et al.
Publicado: (2025)

Input-Erasing Two-Way Finite Automata
por: Meduna, Alexander, et al.
Publicado: (2025)

On Equivalent Characterizations of NP in Abstract Models of Computation
por: Kirn, Jeremy C., et al.
Publicado: (2025)

Place Bisimilarity is Decidable, Indeed!
por: Gorrieri, Roberto
Publicado: (2021)

Probabilistic Nets-within-Nets
por: Köhler-Bußmeier, Michael
Publicado: (2024)

A "Symbolic" Representation of Object-Nets (Extended Version)
por: Köhler-Bussmeier, Michael, et al.
Publicado: (2024)

Current-State Opacity in Safe Partially Observed Quantum Petri Nets: True-Concurrency Semantics and Exact Symbolic Verification
por: Ding, Sichen, et al.
Publicado: (2026)

Monitoring Hyperproperties over Observed and Constructed Traces
por: Chalupa, Marek, et al.
Publicado: (2025)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
por: Guillon, Bruno, et al.
Publicado: (2025)

On Transition Constructions for Automata -- A Categorical Perspective
por: Cruchten, Mike
Publicado: (2024)

Kleene Theorems for Lasso Languages and $ω$-Languages
por: Cruchten, Mike
Publicado: (2024)

On the existence of strong proof complexity generators
por: Krajicek, Jan
Publicado: (2022)

Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
por: Dörfler, Julian, et al.
Publicado: (2024)

Weighing Obese Timed Languages
por: Asarin, Eugene, et al.
Publicado: (2025)

Computing the Bandwidth of Meager Timed Automata
por: Asarin, Eugene, et al.
Publicado: (2024)

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
por: Diekert, Volker, et al.
Publicado: (2019)

All Kolmogorov complexity functions are optimal, but are some more optimal?
por: Bauwens, Bruno, et al.
Publicado: (2025)

A Logspace Constructive Proof of L=SL
por: Buss, Sam, et al.
Publicado: (2025)

E-variables and tests of randomness for distribution classes
por: Potapov, Georgii, et al.
Publicado: (2026)

Formal Foundations for Controlled Stochastic Activity Networks
por: Movaghar, Ali
Publicado: (2025)

Determination of the fifth Busy Beaver value
por: The bbchallenge Collaboration, et al.
Publicado: (2025)

Finite-State Machines for Horospheres in Hyperbolic Right-Angled Coxeter Groups
por: Jillson, Noah, et al.
Publicado: (2024)

Classically Time-Controlled Quantum Automata: Definition and Properties
por: Díaz-Caro, Alejandro, et al.
Publicado: (2018)

Extended Nullstellensatz proof systems
por: Krajicek, Jan
Publicado: (2023)

Reversible computations are computations
por: Aubert, Clément, et al.
Publicado: (2025)

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
por: Schewe, Klaus-Dieter
Publicado: (2020)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
por: Huseynzade, Rafig
Publicado: (2025)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
por: Lopez, Aliaume
Publicado: (2024)

A declarative approach to specifying distributed algorithms using three-valued modal logic
por: Gabbay, Murdoch J., et al.
Publicado: (2025)

Decidable Reversible Equivalences for Finite Petri Nets
por: Gorrieri, Roberto, et al.
Publicado: (2025)

An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$+log Lower Bound for 3SAT via Balanced 3XOR
por: Lela, Marko
Publicado: (2025)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
por: Esparza, Javier, et al.
Publicado: (2025)

Hexagonal Picture Scanning Automata
por: D, Deepalakshmi, et al.
Publicado: (2025)