Algebra of Self-Replication
Fuente:
arXiv
Saved in:
| Main Author: | Moss, Lawrence S. |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)
by: Buss, Sam, et al.
Published: (2025)
Graded Monads in the Semantics of Nominal Automata
by: Schulze, Hannes, et al.
Published: (2025)
by: Schulze, Hannes, et al.
Published: (2025)
The Fractal Logic of Phi-adic Recursion
by: Rosko, Milan
Published: (2025)
by: Rosko, Milan
Published: (2025)
Insignificant Choice Polynomial Time: A Logic Capturing PTIME
by: Schewe, Klaus-Dieter
Published: (2020)
by: Schewe, Klaus-Dieter
Published: (2020)
Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)
by: Galatos, Nikolaos, et al.
Published: (2025)
On Chaitin's Heuristic Principle and Halting Probability
by: Salehi, Saeed
Published: (2023)
by: Salehi, Saeed
Published: (2023)
Computability of Initial Value Problems
by: Brattka, Vasco, et al.
Published: (2024)
by: Brattka, Vasco, et al.
Published: (2024)
On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)
by: Krajicek, Jan
Published: (2022)
Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)
by: The bbchallenge Collaboration, et al.
Published: (2025)
Probabilistic Nets-within-Nets
by: Köhler-Bußmeier, Michael
Published: (2024)
by: Köhler-Bußmeier, Michael
Published: (2024)
A "Symbolic" Representation of Object-Nets (Extended Version)
by: Köhler-Bussmeier, Michael, et al.
Published: (2024)
by: Köhler-Bussmeier, Michael, et al.
Published: (2024)
On the Realizability of Prime Conjectures in Heyting Arithmetic
by: Rosko, Milan
Published: (2025)
by: Rosko, Milan
Published: (2025)
Reversible computations are computations
by: Aubert, Clément, et al.
Published: (2025)
by: Aubert, Clément, et al.
Published: (2025)
The equational theory of the Weihrauch lattice with (iterated) composition
by: Pradic, Cécilia
Published: (2024)
by: Pradic, Cécilia
Published: (2024)
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
by: Bannach, Max, et al.
Published: (2025)
by: Bannach, Max, et al.
Published: (2025)
The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)
by: Rosko, Milan
Published: (2025)
Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
by: Lopez, Aliaume
Published: (2024)
by: Lopez, Aliaume
Published: (2024)
The reverse mathematics of the pigeonhole hierarchy
by: Houérou, Quentin Le, et al.
Published: (2024)
by: Houérou, Quentin Le, et al.
Published: (2024)
Matching logic -- a new axiomatization
by: Leuştean, Laurenţiu, et al.
Published: (2025)
by: Leuştean, Laurenţiu, et al.
Published: (2025)
Notes on applicative matching logic
by: Leuştean, Laurenţiu
Published: (2025)
by: Leuştean, Laurenţiu
Published: (2025)
A declarative approach to specifying distributed algorithms using three-valued modal logic
by: Gabbay, Murdoch J., et al.
Published: (2025)
by: Gabbay, Murdoch J., et al.
Published: (2025)
Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)
by: Pradic, Cécilia, et al.
Published: (2025)
The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
by: Rahnama, Moses
Published: (2025)
by: Rahnama, Moses
Published: (2025)
Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics
by: Japaridze, Giorgi
Published: (2026)
by: Japaridze, Giorgi
Published: (2026)
Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)
by: Rosko, Milan
Published: (2025)
On the computational properties of basic mathematical notions
by: Normann, Dag, et al.
Published: (2022)
by: Normann, Dag, et al.
Published: (2022)
Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)
by: Sanders, Sam
Published: (2023)
On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)
by: Normann, Dag, et al.
Published: (2024)
A correspondence between the time and space complexity
by: Latkin, Ivan V.
Published: (2023)
by: Latkin, Ivan V.
Published: (2023)
Arithmetics within the Linear Time Hierarchy
by: Pollett, Chris
Published: (2025)
by: Pollett, Chris
Published: (2025)
The equational theory of the Weihrauch lattice with multiplication
by: Neumann, Eike, et al.
Published: (2024)
by: Neumann, Eike, et al.
Published: (2024)
Provability in BI's Sequent Calculus is Decidable
by: Gheorghiu, Alexander, et al.
Published: (2021)
by: Gheorghiu, Alexander, et al.
Published: (2021)
A propositional cirquent calculus for computability logic
by: Japaridze, Giorgi
Published: (2024)
by: Japaridze, Giorgi
Published: (2024)
Computing Distinguishing Formulae for Threshold-Based Behavioural Distances
by: Forster, Jonas, et al.
Published: (2026)
by: Forster, Jonas, et al.
Published: (2026)
Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)
by: Rydval, Jakub
Published: (2021)
Universal Algebra in UniMath
by: Amato, Gianluca, et al.
Published: (2021)
by: Amato, Gianluca, et al.
Published: (2021)
Relative Constructibility via Generalised Sequential Algorithms
by: Lau, Desmond
Published: (2024)
by: Lau, Desmond
Published: (2024)
The Golden Path to Guarded Monotone Strict NP
by: Barsukov, Alexey, et al.
Published: (2023)
by: Barsukov, Alexey, et al.
Published: (2023)
QSeqSim: A Symbolic Simulator for Qiskit While Loops Using Sequential Quantum Circuits
by: Li, Zihao, et al.
Published: (2026)
by: Li, Zihao, et al.
Published: (2026)
Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)
by: Huseynzade, Rafig
Published: (2025)
Similar Items
-
A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025) -
Graded Monads in the Semantics of Nominal Automata
by: Schulze, Hannes, et al.
Published: (2025) -
The Fractal Logic of Phi-adic Recursion
by: Rosko, Milan
Published: (2025) -
Insignificant Choice Polynomial Time: A Logic Capturing PTIME
by: Schewe, Klaus-Dieter
Published: (2020) -
Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)