Imagen de Portada

Turing Completeness and Sid Meier's Civilization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	de Wynter, Adrian
Formato:	Preprint
Publicado:	2021
Materias:	Computational Complexity Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Computational Boundary of Inference: Capability Internalization, Training, and the Turing Jump
por: Lu, Chien-Ping
Publicado: (2026)

Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
por: Goertzel, Ben, et al.
Publicado: (2026)

Flat origami is Turing Complete
por: Hull, Thomas C., et al.
Publicado: (2023)

Infinite Time Turing Machines and their Applications
por: Weerawarana, Rukmal, et al.
Publicado: (2025)

Constant Bit-size Transformers Are Turing Complete
por: Li, Qian, et al.
Publicado: (2025)

Complexity of Scheduling Charging in the Smart Grid
por: de Weerdt, Mathijs, et al.
Publicado: (2017)

If LLMs Have Human-Like Attributes, Then So Does Age of Empires II
por: de Wynter, Adrian
Publicado: (2026)

An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages
por: Fargier, Hélène, et al.
Publicado: (2021)

Solving Multiagent Path Finding on Highly Centralized Networks
por: Fioravantes, Foivos, et al.
Publicado: (2024)

Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs
por: Asadi, Ali, et al.
Publicado: (2026)

Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
por: Eriksson, Leif, et al.
Publicado: (2026)

Over the Edge of Chaos? Excess Complexity as a Roadblock to Artificial General Intelligence
por: Susnjak, Teo, et al.
Publicado: (2024)

CSPs with Few Alien Constraints
por: Jonsson, Peter, et al.
Publicado: (2024)

Probabilistic Generating Circuits -- Demystified
por: Agarwal, Sanyam, et al.
Publicado: (2024)

From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy
por: Dörfler, Julian, et al.
Publicado: (2024)

Parameterized Complexity Of Representing Models Of MSO Formulas
por: Kučera, Petr, et al.
Publicado: (2026)

Diversity of Extensions in Abstract Argumentation
por: Fichte, Johannes K., et al.
Publicado: (2026)

A Structural Complexity Analysis of Hierarchical Task Network Planning
por: Brand, Cornelius, et al.
Publicado: (2024)

ActionReasoningBench: Reasoning about Actions with and without Ramification Constraints
por: Handa, Divij, et al.
Publicado: (2024)

Forgetting in short and heterogeneous sequences of belief revisions
por: Liberatore, Paolo
Publicado: (2025)

Solving Quantified Boolean Formulas with Few Existential Variables
por: Eriksson, Leif, et al.
Publicado: (2024)

Social Distancing Induced Coronavirus Optimization Algorithm (COVO): Application to Multimodal Function Optimization and Noise Removal
por: Varma, Om Ramakisan, et al.
Publicado: (2024)

Probabilistic Explanations for Linear Models
por: Subercaseaux, Bernardo, et al.
Publicado: (2024)

Explaining Decisions in ML Models: a Parameterized Complexity Analysis
por: Ordyniak, Sebastian, et al.
Publicado: (2024)

The Complexity of Symmetry Breaking Beyond Lex-Leader
por: Anders, Markus, et al.
Publicado: (2024)

On the Complexity of Identification in Linear Structural Causal Models
por: Dörfler, Julian, et al.
Publicado: (2024)

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
por: Fioravantes, Foivos, et al.
Publicado: (2024)

Value Iteration with Guessing for Markov Chains and Markov Decision Processes
por: Chatterjee, Krishnendu, et al.
Publicado: (2025)

The Limits of Tractable Marginalization
por: Broadrick, Oliver, et al.
Publicado: (2025)

Structure-Aware Encodings of Argumentation Properties for Clique-width
por: Mahmood, Yasir, et al.
Publicado: (2025)

On the Holographic Geometry of Deterministic Computation
por: Nye, Logan
Publicado: (2025)

Debate is efficient with your time
por: Brown-Cohen, Jonah, et al.
Publicado: (2026)

Universal NP-Hardness of Clustering under General Utilities
por: Majumdar, Angshul
Publicado: (2026)

Complexity Results of Persuasion
por: Grastien, Alban
Publicado: (2025)

Training Cross-Morphology Embodied AI Agents: From Practical Challenges to Theoretical Foundations
por: Liu, Shaoshan, et al.
Publicado: (2025)

Gateways to Tractability for Satisfiability in Pearl's Causal Hierarchy
por: Ganian, Robert, et al.
Publicado: (2025)

A Quantale-Weakness Route to $P \neq NP$ via CD Evidence Normalization and Gauge-Buffered Locked Ensembles
por: Goertzel, Ben
Publicado: (2025)

Barriers to Complexity-Theoretic Proofs that "AGI" Using Machine Learning is Impossible
por: Guerzhoy, Michael
Publicado: (2024)

If Eleanor Rigby Had Met ChatGPT: A Study on Loneliness in a Post-LLM World
por: de Wynter, Adrian
Publicado: (2024)

Will GPT-4 Run DOOM?
por: de Wynter, Adrian
Publicado: (2024)