Image de couverture de livre

A computing machinery using a continuous memory tape

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Oktar, Yigit
Format:	Preprint
Publié:	2023
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The complexity of computing in continuous time: space complexity is precision
par: Blanc, Manon, et autres
Publié: (2024)

The tape reconfiguration problem and its consequences for dominating set reconfiguration
par: Bousquet, Nicolas, et autres
Publié: (2025)

Robust predicate and function computation in continuous chemical reaction networks
par: Calabrese, Kim, et autres
Publié: (2025)

Limit-sure reachability for small memory policies in POMDPs is NP-complete
par: Asadi, Ali, et autres
Publié: (2024)

On the computational power of $C$-random strings
par: Milovanov, Alexey
Publié: (2024)

Man, these New York Times games are hard! A computational perspective
par: Alberti, Alessandro Giovanni, et autres
Publié: (2025)

Time hierarchies for sublogarithmic-space quantum computation
par: Say, A. C. Cem
Publié: (2025)

On the power of counting the total number of computation paths of NPTMs
par: Bakali, Eleni, et autres
Publié: (2023)

Unconventional complexity classes in unconventional computing (extended abstract)
par: Porreca, Antonio E.
Publié: (2024)

Limit on the computational power of $\mathrm{C}$-random strings
par: Milovanov, Alexey
Publié: (2026)

The computational power of discrete chemical reaction networks with bounded executions
par: Doty, David, et autres
Publié: (2024)

Fast polynomial computations with space constraints
par: Grenet, Bruno
Publié: (2025)

Monitoring graph edges via shortest paths: computational complexity and approximation algorithms
par: Colli, Giordano
Publié: (2025)

A new metric for evaluating the performance and complexity of computer programs: A new approach to the traditional ways of measuring the complexity of algorithms and estimating running times
par: Folea, Rares, et autres
Publié: (2025)

Symmetric quantum computation
par: Castro-Silva, Davi, et autres
Publié: (2025)

Stochastic thermodynamics of computation
par: Wolpert, David H.
Publié: (2019)

Is a LOCAL algorithm computable?
par: Cruciani, Antonio, et autres
Publié: (2026)

Proofs of quantum memory
par: Hhan, Minki, et autres
Publié: (2025)

A full dichotomy for Holant$^c$, inspired by quantum computation
par: Backens, Miriam
Publié: (2022)

On hardness of computing analytic Brouwer degree
par: Chakraborty, Somnath
Publié: (2023)

Geometric and computational hardness of bilevel programming
par: Bolte, Jérôme, et autres
Publié: (2024)

Quantum computational complexity of matrix functions
par: Cifuentes, Santiago, et autres
Publié: (2024)

Quantum computation with indefinite causal structures
par: Araújo, Mateus, et autres
Publié: (2017)

Bounding the computational power of bosonic systems
par: Upreti, Varun, et autres
Publié: (2025)

Whether a quantum computation employs nonlocal resources is operationally undecidable
par: Fields, Chris, et autres
Publié: (2025)

A universal bound on the space complexity of Directed Acyclic Graph computations
par: Bilardi, Gianfranco, et autres
Publié: (2024)

Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
par: Allcock, Jonathan, et autres
Publié: (2023)

Physical complexity and black hole quantum computers
par: Reilly, Michele, et autres
Publié: (2025)

Reducing the complexity of computing the values of a Nash equilibrium
par: Chatterjee, Debtoru, et autres
Publié: (2025)

Unifying computational entropies via Kullback-Leibler divergence
par: Agrawal, Rohit, et autres
Publié: (2019)

Improved separation between quantum and classical computers for sampling and functional tasks
par: Marshall, Simon C., et autres
Publié: (2024)

Quantum search by continuous-time quantum walk on t-designs
par: Lugão, Pedro H. G., et autres
Publié: (2023)

Short and useful quantum proofs for sublogarithmic-space verifiers
par: Say, A. C. Cem
Publié: (2025)

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
par: Sakamoto, Kazuki, et autres
Publié: (2025)

How many continuous measurements are needed to learn a vector?
par: Krieg, David, et autres
Publié: (2024)

On the degree of polynomials computing square roots mod p
par: Kedlaya, Kiran, et autres
Publié: (2023)

Classical billiards can compute
par: Miranda, Eva, et autres
Publié: (2025)

On the complexity of computing Strahler numbers
par: Ganardi, Moses, et autres
Publié: (2025)

Hydrodynamic and symbolic models of computation with advice
par: Cardona, Robert
Publié: (2023)

Analog computation with transcriptional networks
par: Doty, David, et autres
Publié: (2025)