Tootfinder

Multiplicative Turing Ensembles, Pareto's Law, and Creativity
Alexander Kolpakov, Aidan Rocke
https://arxiv.org/abs/2510.04167 https://arxiv.org/pdf/25…

Multiplicative Turing Ensembles, Pareto's Law, and Creativity
We study integer-valued multiplicative dynamics driven by i.i.d. prime multipliers and connect their macroscopic statistics to universal codelengths. We introduce the Multiplicative Turing Ensemble (MTE) and show how it arises naturally - though not uniquely - from ensembles of probabilistic Turing machines. Our modeling principle is variational: taking Elias' Omega codelength as an energy and imposing maximum entropy constraints yields a canonical Gibbs prior on integers and, by restriction, o…

Computer scientists: The Turing test is a test of a machine's ability to exhibit intelligent behavior equivalent to that of a human.
Reality: The Turing test is a test of a human's ability not to be fooled by themselves that a machine is mimicking a human.
(Because the test uses a human to decide if something else is a human, it essentially explores the gullibility limit of an individual human—and says nothing about machine intelligence.)

In my opinion, organisations involved in developing military capabilities shouldn't operate as charities.
https://www.ukauthority.com/articles/turing-institute-to-work-on-ai-tools-for-national-security-and-defence-analy…

Turing Institute to work on AI tools for national security and defence analysis | UKAuthority

I've been reading biology related books and by sheer hubris and ADHD delusion I thought about switching careers*! Figuring out life's systems feels more fascinating than figuring out how IT systems should be working together.
Then I found out that Alan Turing has touched both fields. I did not know about that! So here I stand with interests between Turing machines and Turing patterns! Always pretty cool to find out about these connections between fields!
* I won’t!
…

Turing pattern - Wikipedia

Tokyo-based Turing, which is developing an AI model for self-driving vehicles, raised a $99M Series A, sources say at a ~$388M valuation (Min-Jeong Lee/Bloomberg)
https://www.bloomberg.com/news/articles/2025-11-17/ai-startup-t…

«But speaking exclusively to the BBC, [the Turing Institute's] Chair Dr Doug Gurr said the whistleblower claims were "independently investigated" by a third party which found them to have "no substance". […] He did not name the third party which had carried out the investigation.»
Ah yes, the super secret independent investigators, that can't be named or their reports published. It's nice to see how some things don't change 😂
https://www.bbc.com/news/articles/c9q1xdnydwjo

The @… team is hosting an event in London again. Meet at the ARIA offices and hear about building new tools for science.
Ink & Switch is hosting another Social in London on Nov. 11th at the Alan Turing Institute. I'll share some early scientific work in Patchwork, & Marcel will give a peek at the Playbook…

Ink & Switch London: Building new tools for Science · Luma
Ink & Switch's mission is to help computers become better tools for thought. We believe that the promise of computers as "intelligence amplifiers" or "bicycles…

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
Rafig Huseynzade
https://arxiv.org/abs/2510.08577 https://arxiv.o…

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
We introduce Psi-Turing Machines (Psi-TM): classical Turing machines equipped with a constant-depth introspection interface $ ι$ and an explicit per-step information budget $ B(d,n)=c\,d\log_2 n $. With the interface frozen, we develop an information-theoretic lower-bound toolkit: Budget counting, $ Ψ$-Fooling, and $ Ψ$-Fano, with worked examples $ L_k $ and $ L_k^{\mathrm{phase}} $. We prove an oracle-relative separation $ P^Ψ \neq NP^Ψ $ and a strict depth hierarchy, reinforced by an Ant…

Algorithmic Temperature Induced by Adopted Regular Universal Turing Machine
Kentaro Imafuku
https://arxiv.org/abs/2510.11737 https://arxiv.org/pdf/2510.117…

Algorithmic Temperature Induced by Adopted Regular Universal Turing Machine
We prove that an effective temperature naturally emerges from the algorithmic structure of a regular universal Turing machine (UTM), without introducing any external physical parameter. In particular, the redundancy growth of the machine's wrapper language induces a Boltzmann--like exponential weighting over program lengths, yielding a canonical ensemble interpretation of algorithmic probability. This establishes a formal bridge between algorithmic information theory and statistical mechanics, …

A small number of samples can poison LLMs of any size:
https://www.anthropic.com/research/small-samples-poison
"In a joint study with the UK AI Security Institute and the Alan Turing Institute, we found that as few as 250 malicious documents can produce a "

Sources: Meta Chief AI Scientist Yann LeCun plans to leave in the coming months to found his own startup; a source says he is in early talks to raise funds (Financial Times)
https://www.ft.com/content/c586eb77-a16e-4363-ab0b-e877898b70de

Meta chief AI scientist Yann LeCun plans to exit and launch own start-up
Turing Award winner seeks to depart as Mark Zuckerberg makes ‘superintelligence’ push

On Equivalent Characterizations of NP in Abstract Models of Computation
Jeremy C. Kirn, Lucas Meijer, Tillmann Miltzow, Hans L. Bodlaender
https://arxiv.org/abs/2510.05894 https…

On Equivalent Characterizations of NP in Abstract Models of Computation
We investigate machine models similar to Turing machines that are augmented by the operations of a first-order structure $\mathcal{R}$, and we show that under weak conditions on $\mathcal{R}$, the complexity class $\text{NP}(\mathcal{R})$ may be characterized in three equivalent ways: (1) by polynomial-time verification algorithms implemented on $\mathcal{R}$-machines, (2) by the $\text{NP}(\mathcal{R})$-complete problem $\text{SAT}(\mathcal{R})$, and (3) by existential second-order metafinite …

An Algorithmic Information-Theoretic Perspective on the Symbol Grounding Problem
Zhangchi Liu
https://arxiv.org/abs/2510.05153 https://arxiv.org/pdf/2510.0…

An Algorithmic Information-Theoretic Perspective on the Symbol Grounding Problem
This paper provides a definitive, unifying framework for the Symbol Grounding Problem (SGP) by reformulating it within Algorithmic Information Theory (AIT). We demonstrate that the grounding of meaning is a process fundamentally constrained by information-theoretic limits, thereby unifying the Gödelian (self-reference) and No Free Lunch (statistical) perspectives. We model a symbolic system as a universal Turing machine and define grounding as an act of information compression. The argument pr…

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
Rafig Huseynzade

The NPA hierarchy does not always attain the commuting operator value
Marco Fanizza, Larissa Kroell, Arthur Mehta, Connor Paddock, Denis Rochette, William Slofstra, Yuming Zhao
https://arxiv.org/abs/2510.04943

The NPA hierarchy does not always attain the commuting operator value
We show that it is undecidable to determine whether the commuting operator value of a nonlocal game is strictly greater than 1/2. As a corollary, there is a boolean constraint system (BCS) game for which the value of the Navascués-Pironio-Acín (NPA) hierarchy does not attain the commuting operator value at any finite level. Our contribution involves establishing a computable mapping from Turing machines to BCS nonlocal games in which the halting property of the machine is encoded as a decisio…

Self-replication and Computational Universality
Jordan Cotler, Cl\'ement Hongler, Barbora Hudcov\'a
https://arxiv.org/abs/2510.08342 https://arxiv.…