Imagen de Portada

Large Language Models and the Extended Church-Turing Thesis

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wiedermann, Jiří, van Leeuwen, Jan
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

In System Alignments we Trust! Explainable Alignments via Projections
por: Sommers, Dominique, et al.
Publicado: (2025)

Probabilistic Modeling of Spiking Neural Networks with Contract-Based Verification
por: Yao, Zhen, et al.
Publicado: (2025)

Foundation Models for Logistics: Toward Certifiable, Conversational Planning Interfaces
por: Yang, Yunhao, et al.
Publicado: (2025)

Multimodal Pretrained Models for Verifiable Sequential Decision-Making: Planning, Grounding, and Perception
por: Yang, Yunhao, et al.
Publicado: (2023)

Joint Verification and Refinement of Language Models for Safety-Constrained Planning
por: Yang, Yunhao, et al.
Publicado: (2024)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
por: Schwartz, Daniel G.
Publicado: (2025)

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

SELP: Generating Safe and Efficient Task Plans for Robot Agents with Large Language Models
por: Wu, Yi, et al.
Publicado: (2024)

LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning
por: Chen, Lekai, et al.
Publicado: (2024)

Congruence-based Learning of Probabilistic Deterministic Finite Automata
por: Carrasco, Matías, et al.
Publicado: (2024)

TheoremLlama: Transforming General-Purpose LLMs into Lean4 Experts
por: Wang, Ruida, et al.
Publicado: (2024)

Finding path and cycle counting formulae in graphs with Deep Reinforcement Learning
por: Piquenot, Jason, et al.
Publicado: (2024)

BEAVER: An Efficient Deterministic LLM Verifier
por: Suresh, Tarun, et al.
Publicado: (2025)

Stochastic Directly-Follows Process Discovery Using Grammatical Inference
por: Alkhammash, Hanan, et al.
Publicado: (2023)

HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs
por: Ospanov, Azim, et al.
Publicado: (2025)

Inference of Deterministic Finite Automata via Q-Learning
por: Hosseinkhani, Elaheh, et al.
Publicado: (2025)

Mechanics of Learned Reasoning 1: TempoBench, A Benchmark for Interpretable Deconstruction of Reasoning System Performance
por: Holzer, Nikolaus, et al.
Publicado: (2025)

RegexPSPACE: A Benchmark for Evaluating LLM Reasoning on PSPACE-complete Regex Problems
por: Jin, Hyundong, et al.
Publicado: (2025)

Are Agents Probabilistic Automata? A Trace-Based, Memory-Constrained Theory of Agentic AI
por: Koohestani, Roham, et al.
Publicado: (2025)

Computing the Reachability Value of Posterior-Deterministic POMDPs
por: Fijalkow, Nathanaël, et al.
Publicado: (2026)

On Synthesis of Timed Regular Expressions
por: Wang, Ziran, et al.
Publicado: (2025)

Logic-Gated Time-Shared Feedforward Networks for Alternating Finite Automata: Exact Simulation and Learnability
por: Dhayalkar, Sahil Rajesh
Publicado: (2026)

Atomic Gliders and CA as Language Generators (Extended Version)
por: Fisman, Dana, et al.
Publicado: (2025)

On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
por: Dahlsen-Jensen, Mikael Bisgaard, et al.
Publicado: (2024)

On the Effectiveness of Large Language Models in Writing Alloy Formulas
por: Hong, Yang, et al.
Publicado: (2025)

Self-Replicating Mechanical Universal Turing Machine
por: Lano, Ralph P.
Publicado: (2024)

Active Inference of Extended Finite State Machine Models with Registers and Guards
por: Groz, Roland, et al.
Publicado: (2026)

Fine-Tuning Language Models Using Formal Methods Feedback
por: Yang, Yunhao, et al.
Publicado: (2023)

Subtyping in DHOL -- Extended preprint
por: Rothgang, Colin, et al.
Publicado: (2025)

TuringQ: Benchmarking AI Comprehension in Theory of Computation
por: Zahraei, Pardis Sadat, et al.
Publicado: (2024)

Extended time Petri nets
por: Radom, Marcin, et al.
Publicado: (2024)

Cayley Automatic Groups and Numerical Characteristics of Turing Transducers
por: Berdinsky, Dmitry
Publicado: (2016)

Reachability in VASS Extended with Integer Counters
por: Bizière, Clotilde, et al.
Publicado: (2026)

Mind the Gap: A Formal Investigation of the Relationship Between Log and Model Complexity -- Extended Version
por: Schalk, Patrizia, et al.
Publicado: (2025)

INPROVF: Leveraging Large Language Models to Repair High-level Robot Controllers from Assumption Violations
por: Meng, Qian, et al.
Publicado: (2025)

Extended Stone Duality via Monoidal Adjunctions
por: Lenke, Fabian, et al.
Publicado: (2024)

LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
por: Aminof, Benjamin, et al.
Publicado: (2024)

Componentwise Automata Learning for System Integration (Extended Version)
por: Fujinami, Hiroya, et al.
Publicado: (2025)

Simultaneous Task Allocation and Planning for Multi-Robots under Hierarchical Temporal Logic Specifications
por: Luo, Xusheng, et al.
Publicado: (2024)

Active Reward Machine Inference From Raw State Trajectories
por: Shehab, Mohamad Louai, et al.
Publicado: (2026)