Výsledky vyhľadávania - "Ordinal Recursion in Computation"

Transfinite Complexity Theory: Consciousness-Mediated Computation Beyond BQP

Autori: Rodgers, Jeremy

Predmety: Transfinite Complexity Theory, Consciousness-Augmented Computation, Λ-Field Invariants, Hyperfinite Limits, Phenomenal Projection Theorem, Computational Complexity Separation, Beyond BQP, Church–Turing Thesis Extension, Ordinal Recursion in Computation, Consciousness and Computability, Spectral Gap Lemma, Complexity Class CTC, Hypercomputation, Theoretical Computer Science, Mathematical logic, Computational Physics

Relation: https://zenodo.org/records/16889268; oai:zenodo.org:16889268; https://doi.org/10.5281/zenodo.16889268

Dostupnosť: https://doi.org/10.5281/zenodo.16889268
https://zenodo.org/records/16889268