A Reminder – computability limits on “vibe coding” ABMs (using LLMS to do the programming for us) By Bruce Edmonds Introduction Machine-learning systems, including Large Language Models (LLMs), are algorithms trained on large datasets rather than something categorically different. Consequently,…

New Contribution: A Reminder – computability limits on “vibe coding” ABMs by Bruce Edmonds. rofasss.org/2026/02/12/v... #rofasss #ABM #agentbased #programming #LLMs #AI #vibecoding #computability

The pdf of the extended abstract (more readable than the pics in the original post) is here👇🏼 too:
drive.google.com/file/d/1evKU...
Thanks again for your comments and suggestions.
#Computability #ProofTheory
4/

The Illusion of Thinking: Understanding the Strengths and Limitations of Reasoning Models via the Lens of Problem Complexity Recent generations of language models have introduced Large Reasoning Models (LRMs) that generate detailed thinking processes before providing answers. While these models demonstrate improved performa...

The illusion of thinking "Are these (Large Language / Reasoning) models capable of generalizable reasoning, or are they leveraging different forms of pattern matching?" #AI #Computability

arxiv.org/abs/2506.06941

Some AI Systems May Be Impossible to Compute New research suggests there are limitations to deep neural networks can and cannot do

Some AI Systems May Be Impossible to Compute

The limits of our current approach to AI. The halting problem in the context of neural networks. #AI #Computability

spectrum.ieee.org/deep-neural-...

I've been thinking about something that's related to Tarski's undefinability theorem (and might possibly be a corollary if viewed from the right angle), but relates to computability rather than truth. It seems to have implications for systems like Agda and Rocq, which I don't have much […]

Rózsa Péter: Mother of Recursion Theory Who Laid Computing’s Mathematical Foundations Rózsa Péter transformed abstract recursive function theory into the mathematical foundation of modern computing. Despite facing career barriers under Hungary’s Jewish Laws, she developed eleg…

Rózsa Péter: Mother of Recursion Theory Who Laid Computing's Mathematical Foundations
voxmeditantis.com/2025/09/20/r...

#WomenInSTEM #STEM #Recursion #Computability #Logic

The Busy Beaver problem profoundly illustrates the limits of computability, linking directly to the Halting Problem. While BB(5) is now known, it highlights how rapidly these values become uncomputable. #Computability 4/6

Researchers Determine Fifth Busy Beaver Value Using Formal Proof

Researchers verified the fifth Busy Beaver number, S(5), as 47,176,870 steps after checking 181,385,789 five‑state Turing machines—the first new value in over 40 years. getnews.me/researchers-determine-fi... #busybeaver #computability #coq

Excited to host #CCC2025 in Swansea next week!
A workshop on logic & computation, focusing on algorithms for infinite/continuous data (real numbers, computable analysis & more). More info: swansea-theory.github.io/conferences/...

#Logic #Computability #Algorithms #Research

👉 Bottom line:
Some problems are decidable.
Others are fundamentally undecidable.
This is a mathematical boundary, not a technological one.

#Computability #algorithms

5/🧵

🧵 Alan Turing showed not everything logically definable is computable.

Using Cantor’s diagonal argument, we build a set D of Turing machine codes that don’t halt on themselves.

🔁 The twist: no Turing machine can generate D without contradiction.

#Turing #computability

1/🧵

I'm pleased to announce that the Heyting Day will be held in Amsterdam on Friday 14 March 2025.

Its theme will be models of #intuitionism and #computability and mark the retirement of Jaap van Oosten.

The invited speakers are:
- @andrejbauer (Ljubljana)
- […]

[Original post on mathstodon.xyz]

Effective Littlestone Dimension Delle Rose et al.~(COLT'23) introduced an effective version of the Vapnik-Chervonenkis dimension, and showed that it characterizes improper PAC learning with total computable learners. In this paper, ...

Preprint! This paper presents a surprising interplay between computability and combinatorial characterization of online learning in uniform mistake bound regime and it just got accepted to ALT 2025. #MLSky 🧪#AI #ML #computability