Imagen de Portada

Meta-Mathematics in The Holy Quran: Open Problems and Prospects

Fuente: Zenodo

Guardado en:

Detalles Bibliográficos
Autor principal:	Mageed, Ismail A
Formato:	Recurso digital
Publicado:	Zenodo 2026
Materias:	Meta-Mathematics Algorithmic Information Theory Computational Theology Kolmogorov Complexity Natural Language Processing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Virtual Machines in a Physical Substrate: The Thermodynamic Cost of False Information and Systemic Lag (MetaTime v35.6.2 — Technical Annex / Research Note)
por: Peyru, Dario
Publicado: (2026)

Toward Formalizing Non-Monotonic Reasoning in Physics: the Use of Kolmogorov Complexity
por: Vladik Kreinovich
Publicado: (2009)

An Attempted Symbolic Entropy Proof of the Collatz Conjecture via Canonical Rewrite Grammars
por: Fathi, Kevin
Publicado: (2025)

Chapter Random sequences, incompleteness and information
por: Duccio, Pianigiani
Publicado: (2026)

Undirected Multicast Network Coding Gaps via Locally Decodable Codes
por: Braverman, Mark, et al.
Publicado: (2025)

On the Boundaries of Informational Physics
por: Kozyra, Rainer
Publicado: (2026)

On the Boundaries of Informational Physics
por: Kozyra, Rainer
Publicado: (2026)

Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric
por: Bhattacharya, Sudatta, et al.
Publicado: (2025)

La prueba de hipótesis Kolmogorov-Smirnov para dos muestras grandes con una cola
por: Arabel Moraguez-Iglesias
Publicado: (2017)

On Classifying Continuous Constraint Satisfaction Problems
por: Miltzow, Tillmann, et al.
Publicado: (2021)

My Discovery of "Phantom Tunnels" in Turbulent Systems: A Fractal Approach to Energy Transfer
por: İBAGÜNER, SİNAN
Publicado: (2025)

Reseña sobre el estado del arte de la aplicación del modelo Fokker- Planck-Kolmogorov en la estimación de amenazas hidrológicas
por: Diana Carolina Palacio Gómez
Publicado: (2016)

An $Ω( (\log n / \log \log n)^2 )$ Cell-Probe Lower Bound for Dynamic Boolean Data Structures
por: Ko, Young Kun
Publicado: (2026)

List Decoding Expander-Based Codes up to Capacity in Near-Linear Time
por: Srivastava, Shashank, et al.
Publicado: (2025)

Linear Index for Logarithmic Search-Time for any String under any Internal Node in Suffix Trees
por: Al-okaily, Anas
Publicado: (2024)

Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold
por: Gu, Yuzhou, et al.
Publicado: (2025)

Optimality of Frequency Moment Estimation
por: Braverman, Mark, et al.
Publicado: (2024)

Improved Decoding of Tanner Codes
por: Zhou, Zhaienhe, et al.
Publicado: (2025)

Alphabet Reduction for Reconfiguration Problems
por: Ohsaka, Naoto
Publicado: (2024)

The Days On Days Off Scheduling Problem
por: Nießen, Fabien, et al.
Publicado: (2024)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
por: Oostveen, Jelle J., et al.
Publicado: (2022)

Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
por: Hirahara, Shuichi, et al.
Publicado: (2023)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
por: DeHaan, Ian, et al.
Publicado: (2025)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

Algorithmizing the Multiplicity Schwartz-Zippel Lemma
por: Bhandari, Siddharth, et al.
Publicado: (2021)

The Rate-Immediacy Barrier in Explicit Tree Code Constructions
por: Cohen, Gil, et al.
Publicado: (2025)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
por: Goldenberg, Elazar, et al.
Publicado: (2024)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
por: Foucaud, Florent, et al.
Publicado: (2023)

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited
por: Kratochvíl, Jan, et al.
Publicado: (2020)

Adjoint Projections on Computational Hierarchies: A Metric Framework
por: Kowalczyk, Karol
Publicado: (2025)

retracted
por: Fathi, Kevin
Publicado: (2025)

Graph Search Trees and the Intermezzo Problem
por: Beisegel, Jesse, et al.
Publicado: (2024)

Space Efficient Algorithms for Parameterised Problems
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

A Fixed-Parameter Algorithm for the Kneser Problem
por: Haviv, Ishay
Publicado: (2022)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
por: Scheffler, Robert
Publicado: (2025)

Solving Problems on Generalized Convex Graphs via Mim-Width
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2020)

Explicit Lossless Vertex Expanders
por: Hsieh, Jun-Ting, et al.
Publicado: (2025)

Quantum Measurement as a Bateson Function: Probabilistic Grammar and Irreversibility
por: Fathi, Kevin
Publicado: (2025)

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
por: Abrahamsen, Mikkel, et al.
Publicado: (2020)

Computation-Utility-Privacy Tradeoffs in Bayesian Estimation
por: Chen, Sitan, et al.
Publicado: (2026)