Imagen de Portada

A note reviewing Turing's 1936

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Cattabriga, Paola
Formato:	Preprint
Publicado:	2013
Materias:	Computational Complexity Logic in Computer Science 03D10, 68Qxx
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Refutability as Recursive as Provability
por: Cattabriga, Paola
Publicado: (2024)

Homogeneous Algebraic Complexity Theory and Algebraic Formulas
por: Dutta, Pranjal, et al.
Publicado: (2023)

On Godel's treatment of the undecidable in 1931
por: Cattabriga, Paola
Publicado: (2024)

Quantum Random Self-Modifiable Computation
por: Fiske, Michael Stephen
Publicado: (2018)

Reflections on Russell's antinomy
por: Cattabriga, Paola
Publicado: (2024)

A Minimal Substitution Basis for the Kalmár Elementary Functions
por: Prunescu, Mihai, et al.
Publicado: (2025)

Exploring P versus NP
por: Tang, Jian-Gang
Publicado: (2022)

Semi-Algebraic Proof Systems for QBF
por: Beyersdorff, Olaf, et al.
Publicado: (2025)

Adversarial Barrier in Uniform Class Separation
por: Rosko, Milan
Publicado: (2025)

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

Choiceless Polynomial Space
por: Ferrarotti, Flavio, et al.
Publicado: (2024)

Exact Non-Identity Check and Gate-Teleportation-Based Indistinguishability Obfuscation are NP-hard for Low-T-Depth Quantum Circuits
por: Nevin, Joshua
Publicado: (2025)

Computational Complexity of Model-Checking Quantum Pushdown Systems
por: Lin, Deren, et al.
Publicado: (2025)

A proof of P!=NP
por: McCallum, Rupert
Publicado: (2020)

Finitely Bounded Homogeneity Turned Inside-Out
por: Rydval, Jakub
Publicado: (2021)

On a bi-lateral Adding Machine and its characterization
por: Mehdipour, Pouya, et al.
Publicado: (2025)

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

There is a deep 1-generic set
por: Li, Ang
Publicado: (2024)

From Witness-Space Sharpness To Family-Pointwise Exactness For The Solvability Complexity Index
por: Sorg, Christopher
Publicado: (2026)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2025)

Online and feasible presentability: from trees to modal algebras
por: Bazhenov, Nikolay, et al.
Publicado: (2025)

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning
por: Kattermann, David, et al.
Publicado: (2025)

A Formal Analysis of Algorithms for Matroids and Greedoids
por: Abdulaziz, Mohammad, et al.
Publicado: (2025)

On Chaitin's Heuristic Principle and Halting Probability
por: Salehi, Saeed
Publicado: (2023)

The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
por: Kátay, Tamás, et al.
Publicado: (2023)

Biological arrow of time: Emergence of tangled information hierarchies and self-modelling dynamics
por: Prokopenko, Mikhail, et al.
Publicado: (2024)

An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees
por: Samra, Jean Abou, et al.
Publicado: (2026)

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

Complexities of Well-Quasi-Ordered Substructural Logics
por: Galatos, Nikolaos, et al.
Publicado: (2025)

Fast LDL factorization for dense and sparse symmetric matrices over an arbitrary field
por: Solomonik, Edgar
Publicado: (2025)

Algebra of Self-Replication
por: Moss, Lawrence S.
Publicado: (2023)

From Gödel incompleteness to the consistency of circuit lower bounds
por: Atserias, Albert, et al.
Publicado: (2026)

On the incomputability of computable dimension
por: Staiger, Ludwig
Publicado: (2019)

The strength of Ramsey Theorem for coloring relatively large sets
por: Carlucci, Lorenzo, et al.
Publicado: (2012)

Formalising New Mathematics in Isabelle: Diagonal Ramsey
por: Paulson, Lawrence C
Publicado: (2025)

Variants of Solovay reducibility
por: Titov, Ivan
Publicado: (2024)

Reducts of fuzzy contexts: Formal concept analysis vs. rough set theory
por: Chen, Yuxu, et al.
Publicado: (2025)

Some derivations among Logarithmic Space Bounded Counting Classes
por: Janaki, V., et al.
Publicado: (2023)

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

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