Cover Image

Smooth Approximations of the Rounding Function

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Semenov, Stanislav
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control 03F60, 26E40 F.4.1; F.1.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Smooth Integer Encoding via Integral Balance
by: Semenov, Stanislav
Published: (2025)

A Smooth Analytical Approximation of the Prime Characteristic Function
by: Semenov, Stanislav
Published: (2025)

Wave Arithmetic: A Smooth Integral Representation of Number Theory
by: Semenov, Stanislav
Published: (2025)

Fractal Origin of the Continuum: A Hypothesis on Process-Relative Definability
by: Semenov, Stanislav
Published: (2025)

On the Nature of Fractal Numbers and the Classical Continuum Hypothesis (CH)
by: Semenov, Stanislav
Published: (2025)

Axiomatic Foundations of Fractal Analysis and Fractal Number Theory
by: Semenov, Stanislav
Published: (2025)

Invariant Bridges Between Four Successive Points: A New Tool for Data Coding
by: Semenov, Stanislav
Published: (2025)

Fractal Analysis on the Real Interval: A Constructive Approach via Fractal Countability
by: Semenov, Stanislav
Published: (2025)

Invariant-Based Cryptography
by: Semenov, Stanislav
Published: (2025)

Invariant-Based Cryptography: Toward a General Framework
by: Semenov, Stanislav
Published: (2025)

On the computational properties of ambivalent sets and functions
by: Normann, Dag, et al.
Published: (2026)

Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)

Constructive Limits of Cantor's Diagonal Method: Countability, Enumerability, and the Impossibility of Exhausting the Continuum
by: Semenov, Stanislav
Published: (2025)

Fractal Countability as a Constructive Alternative to the Power Set of N: A Meta-Formal Approach to Stratified Definability
by: Semenov, Stanislav
Published: (2025)

Fractal Boundaries of Constructivity: A Meta-Theoretical Critique of Countability and Continuum
by: Semenov, Stanislav
Published: (2025)

Consistent ultrafinitist logic
by: Gajda, Michał J.
Published: (2021)

A formalization of Borel determinacy in Lean
by: Manthe, Sven
Published: (2025)

Relative Constructibility via Generalised Sequential Algorithms
by: Lau, Desmond
Published: (2024)

Undecidability in Relevant Logic
by: Knudstorp, Søren Brinck
Published: (2026)

Y is a least fixed point combinator
by: Helfer, Joseph
Published: (2025)

Extended Nullstellensatz proof systems
by: Krajicek, Jan
Published: (2023)

A Guide to Krivine Realizability for Set Theory
by: Matthews, Richard
Published: (2023)

Forcing as a Local Method of Accessing Small Extensions
by: Lau, Desmond
Published: (2024)

On the Realizability of Prime Conjectures in Heyting Arithmetic
by: Rosko, Milan
Published: (2025)

A proof complexity conjecture and the Incompleteness theorem
by: Krajicek, Jan
Published: (2023)

On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025)

What If Turing Had Preceded Gödel?
by: Oberhoff, Sebastian
Published: (2024)

Punctually Standard and Nonstandard Models of Natural Numbers
by: Bazhenov, Nikolay, et al.
Published: (2026)

Internal Effectful Forcing in System T
by: Escardo, Martin H., et al.
Published: (2025)

Proof Compression via Subatomic Logic and Guarded Substitutions
by: Barrett, Victoria, et al.
Published: (2025)

On the equivalence of Occam algorithms
by: Keinath-Esmail, Zaman
Published: (2023)

Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)

Learning Families of Algebraic Structures from Text
by: Bazhenov, Nikolay, et al.
Published: (2024)

Fixed-Point Theorems and the Ethics of Radical Transparency: A Logic-First Treatment
by: Alpay, Faruk, et al.
Published: (2025)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
by: Rahnama, Moses
Published: (2025)

Computable Approximations of Semicomputable Graphs
by: Čačić, Vedran, et al.
Published: (2024)

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

The Category Dichotomy for Ideals
by: Dow, Alan, et al.
Published: (2025)