Copertina

You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	MIT Hardness Group, Ani, Hayashi, Demaine, Erik D., Hall, Holden, Ruiz, Ricardo, Venkat, Naveen
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

PSPACE-Hard 2D Super Mario Games: Thirteen Doors
di: MIT Hardness Group, et al.
Pubblicazione: (2024)

Tetris with Few Piece Types
di: MIT Hardness Group, et al.
Pubblicazione: (2024)

Tetris is Hard with Just One Piece Type
di: MIT Hardness Group, et al.
Pubblicazione: (2026)

Planar Graph Orientation Frameworks, Applied to KPlumber and Polyomino Tiling
di: MIT Hardness Group, et al.
Pubblicazione: (2026)

Complexity of 2D Snake Cube Puzzles
di: MIT Hardness Group, et al.
Pubblicazione: (2024)

Pushing Blocks without Fixed Walls via Checkable Gizmos: Push-1 is PSPACE-Complete
di: MIT Hardness Group, et al.
Pubblicazione: (2025)

Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants
di: MIT Hardness Group, et al.
Pubblicazione: (2024)

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles
di: MIT Hardness Group, et al.
Pubblicazione: (2024)

Walking through Doors is Hard, even without Staircases: Universality and PSPACE-hardness of Planar Door Gadgets
di: MIT Gadgets Group, et al.
Pubblicazione: (2020)

Pushing Blocks via Checkable Gadgets: PSPACE-completeness of Push-1F and Block/Box Dude
di: Ani, Hayashi, et al.
Pubblicazione: (2024)

Baba is You is Undecidable
di: Geller, Jonathan
Pubblicazione: (2022)

Text-to-Level Diffusion Models With Various Text Encoders for Super Mario Bros
di: Schrum, Jacob, et al.
Pubblicazione: (2025)

Graph Threading with Turn Costs
di: Demaine, Erik D., et al.
Pubblicazione: (2024)

On Formally Undecidable Propositions of Nondeterministic Complexity and Related Classes
di: Kolář, Martin
Pubblicazione: (2026)

Tiling with Three Polygons is Undecidable
di: Demaine, Erik D., et al.
Pubblicazione: (2024)

Super Mario Bros., tres décadas de su primera aventura
di: Domenech Alcaide, Andrés
Pubblicazione: (2015)

Undecidability of Polynomial Inequalities in Subset Densities and Additive Energies
di: Li, Yaqiao
Pubblicazione: (2025)

Undecidability of Translational Tiling with Three Tiles
di: Yang, Chan, et al.
Pubblicazione: (2024)

Circle packing and Riemann uniformization of random planar maps in an ergodic scale-free environment
di: Holden, Nina, et al.
Pubblicazione: (2026)

Undecidability of tiling the plane with a fixed number of Wang bars
di: Yang, Chao, et al.
Pubblicazione: (2024)

A Critique of Chen's "The 2-MAXSAT Problem Can Be Solved in Polynomial Time"
di: Le, Tran Duy Anh, et al.
Pubblicazione: (2024)

Can You Link Up With Treewidth?
di: Curticapean, Radu, et al.
Pubblicazione: (2024)

A Pair of Bayesian Network Structures has Undecidable Conditional Independencies
di: Li, Cheuk Ting
Pubblicazione: (2024)

Undecidability and incompleteness in quantum information theory and operator algebras
di: Goldbring, Isaac
Pubblicazione: (2024)

Undecidability of Translational Tiling of the 4-dimensional Space with a Set of 4 Polyhypercubes
di: Yang, Chao, et al.
Pubblicazione: (2024)

Undecidability of Translational Tiling of the 3-dimensional Space with a Set of 6 Polycubes
di: Yang, Chao, et al.
Pubblicazione: (2024)

Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems
di: Lemke, Caroline, et al.
Pubblicazione: (2025)

Computational Complexity of Game Boy Games
di: Tirmazi, Hayder, et al.
Pubblicazione: (2024)

Joint scaling limit of a bipolar-oriented triangulation and its dual in the peanosphere sense
di: Gwynne, Ewain, et al.
Pubblicazione: (2016)

Computational Irreducibility as the Foundation of Agency: A Formal Model Connecting Undecidability to Autonomous Behavior in Complex Systems
di: Azadi, Poria
Pubblicazione: (2025)

Super Unique Tarski is in UEOPL
di: Fearnley, John, et al.
Pubblicazione: (2024)

Solving Four Open Problems about Core Stability in Altruistic Hedonic Games
di: Rothe, Jörg, et al.
Pubblicazione: (2025)

Game Derandomization
di: Epstein, Samuel
Pubblicazione: (2024)

Folding One Polyhedral Metric Graph into Another
di: Chung, Lily, et al.
Pubblicazione: (2024)

Retracted: The MGHSS for Solving Continuous Sylvester Equation AX + XB = C
di: Complexity
Pubblicazione: (2024)

Solving the $\partial \bar{\partial}$ with prescribed support
di: Ingoba, Winnie Ossete, et al.
Pubblicazione: (2025)

An Efficient Algorithm for Solving the 2-MAXSAT Problem
di: Chen, Yangjun
Pubblicazione: (2023)

Continuous Flattening and Reversing of Convex Polyhedral Linkages
di: Demaine, Erik D., et al.
Pubblicazione: (2024)

Undecidability of the block gluing classes of homshifts
di: Chandgotia, Nishant, et al.
Pubblicazione: (2025)

Positive Moments Forever: Undecidable and Decidable Cases
di: Coves, Gemma De les, et al.
Pubblicazione: (2024)