Tootfinder

Battle Royale, by Koushun Takami
https://turing.mailstation.de/battle-royale-by-koushun-takami/?feed_id=2870&_unique_id=65bf877ed0394

Yeah, keep telling us #ChatGPT isn't GAI, while it elegantly bats away unwanted expressions of affection and learns to speak in an obscure joke dialect from context.
My dudes, we swallowed the Turing Test as an adequate alternative to a definition of intelligence for a long time, and this thing is waaaaaayyyyy past that.

Angels Flight (Harry Bosch #6), by Michael Connelly
https://turing.mailstation.de/angels-flight-harry-bosch-6-by-michael-connelly/?feed_id=3315&_unique_id=6636062d930fa

This https://arxiv.org/abs/2310.20221 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Cayley Linear-Time Computable Groups
This paper looks at the class of groups admitting normal forms for which the right multiplication by a group element is computed in linear time on a multi-tape Turing machine. We show that the groups $\mathbb{Z}_2 \wr \mathbb{Z}^2$, $\mathbb{Z}_2 \wr \mathbb{F}_2$ and Thompson's group $F$ have normal forms for which the right multiplication by a group element is computed in linear time on a $2$-tape Turing machine. This refines the results previously established by Elder and the authors that th…

Murder in Tuscany (Armstrong and Oscar Cozy Mysteries #1), by T.A. Williams
https://turing.mailstation.de/murder-in-tuscany-armstrong-and-oscar-cozy-mysteries-1-by-t-a-williams/?feed_i…

"The name of Kurt Gödel often appears in the pages of this magazine, and with reason. After all, the thought process that led to modern computing has Gödel as a major milestone and can be clumsily summarized as follows: Cantor ⇒ Hilbert ⇒ Russell ⇒ Gödel ⇒ Church ⇒ Turing ⇒ Von Neumann."
https://

Guillermo Martínez & Gustavo Piñeiro
So far, in this Library section, we have only covered books in English. We have already discussed the hegemony of this language, and we think it is important to challenge it; so today we break the mould and introduce a book originally published in Spanish in 2009, "Gödel ∀ (para todos)" by Argentine mathematicians Guillermo Martínez and Gustavo Piñeiro, the former also a renowned fiction author.

Zufallsexperte: ACM Turing-Award geht in diesem Jahr an Avi Wigderson
Der Mathematikprofessor Wigderson lehrt und forscht zu theoretischer Informatik an der Uni Princeton, speziell zu Zufallszahlen.

Computer scientist Avi Wigderson wins the 2023 Turing Award for his "foundational contributions to the theory of computation", including his work on randomness (Stephen Ornes/Quanta Magazine)
https://www.quantamagazine.org/avi-wigders

Avi Wigderson, Complexity Theory Pioneer, Wins Turing Award | Quanta Magazine
The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more.

Some things were not supposed to be Turing-complete, but are!
This is a collection of such accidents.
Stuff which is somehow limited (stack overflows, arbitrary configuration, etc) is still considered Turing complete, since all "physical" Turing machines are resource limited.

Ah yes, I implemented a Turing complete programming language again, because I can't possibly have config files that are not Turing complete can I now

For mysterious reasons, it's taken WaPo two months to report on the 1/1/24 death of Turing Award winner Niklaus Emil Wirth, who brought us Pascal and Modula-2 and evidently even the computer mouse. Gift link. #NEW
https://wapo.st/42YuMyl<…

AuDaLa is Turing Complete
Tom T. P. Franken, Thomas Neele
https://arxiv.org/abs/2404.12934 https://arxiv.org/pdf/2404.12934

AuDaLa is Turing Complete
AuDaLa is a recently introduced programming language that follows the new data autonomous paradigm. In this paradigm, small pieces of data execute functions autonomously. Considering the paradigm and the design choices of AuDaLa, it is interesting to determine the expressiveness of the language and to create verification methods for it. In this paper, we take our first steps to such a verification method by implementing Turing machines in AuDaLa and proving that implementation correct. This als…

This https://arxiv.org/abs/2404.17784 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Logical Characterizations of Weighted Complexity Classes
Fagin's seminal result characterizing $\mathsf{NP}$ in terms of existential second-order logic started the fruitful field of descriptive complexity theory. In recent years, there has been much interest in the investigation of quantitative (weighted) models of computations. In this paper, we start the study of descriptive complexity based on weighted Turing machines over arbitrary semirings. We provide machine-independent characterizations (over ordered structures) of the weighted complexity cla…

i remember something about a moderately exotic computer architecture. it seems to be quite radical/minimalist in that it doesn't have have an add instruction so you have to implement additions yourself. as i understand it there was commercial hardware using it.
i'm pretty sure it was it was not: OISC, FPGA, and presumably more CPU-like than cellular automata, tag systems, Turing machines or the like.
do you have any idea what it might be? i think i didn't dream this 😅…

Oh wow, so many interesting things (that I have no idea what they are) to google for in this image. Like Arbitrary Code Execution in the Universal Turing Machine, wtf? https://arxiv.org/abs/2105.02124
From: @…

Intrinsic Propensity for Vulnerability in Computers? Arbitrary Code Execution in the Universal Turing Machine
The universal Turing machine is generally considered to be the simplest, most abstract model of a computer. This paper reports on the discovery of an accidental arbitrary code execution vulnerability in Marvin Minsky's 1967 implementation of the universal Turing machine. By submitting crafted data, the machine may be coerced into executing user-provided code. The article presents the discovered vulnerability in detail and discusses its potential implications. To the best of our knowledge, an ar…

(From The Economist)
Mustafa Suleyman (DeepMind) believes that AGI will have been reached when a model is given $100,000 and turns it into $1m without instruction.
Steve Wozniak (Apple) has a more prosaic vision of AGI: a machine that can enter an average home and make a cup of coffee.
So if the Turing Test led us to large language models, what might we end up with from these tests?
#AGI

Let's just say that I find it hard to square that outcome with a process that was a “free and fair competition and on the basis of merit”: «Staff at Alan Turing Institute speak out after four men given top roles»
https://www.theguardian.com/science/2024/mar/11/staff-at-alan-turing-institute-speak-out-after-four-men-given-top-roles

"Every probabilistic algorithm that's efficient can be replaced by a deterministic one, so you don't really need [randomness] [...] The power believed to be in probabilistic algorithms doesn't exist." — Avi Wigderson
(Think on this, fellow generative artists! 😅 FWIW In my own work, I've learned to limit use of PRNGs to the absolute bare minimum, use as shorthand or for deferring design decisions to be solved in other [more controllable/intentional] ways later …

Computer scientist wins Turing Award for seminal work on randomness
Avi Wigderson helped prove that randomness is not required for efficient computation.

Trunk Music (Harry Bosch #5), by Michael Connelly
https://turing.mailstation.de/trunk-music-harry-bosch-5-by-michael-connelly/?feed_id=3261&_unique_id=6631112d02fc8

Alexander Pruss's Blog || A tweak to the Turing test
http://alexanderpruss.blogspot.com/2024/03/a-tweak-to-turing-test.html

Topological entropy of Turing complete dynamics
Renzo Bruera, Robert Cardona, Eva Miranda, Daniel Peralta-Salas
https://arxiv.org/abs/2404.07288 https://…

Topological entropy of Turing complete dynamics
We explore the relationship between Turing completeness and topological entropy of dynamical systems. We first prove that a natural class of Turing machines (which includes most of the examples of universal Turing machines) has positive topological entropy. We deduce that any Turing complete dynamics with a continuous encoding that simulates a universal machine in this class is chaotic. This applies to our previous constructions of Turing complete area-preserving diffeomorphisms of the disk and…

@… Regex sind der Turing-Test an dem die KI scheitert!

This https://arxiv.org/abs/2208.04525 has been replaced.
link: https://scholar.google.com/scholar?q=a

Using Large Context for Kidney Multi-Structure Segmentation from CTA Images
Accurate and automated segmentation of multi-structure (i.e., kidneys, renal tu-mors, arteries, and veins) from 3D CTA is one of the most important tasks for surgery-based renal cancer treatment (e.g., laparoscopic partial nephrectomy). This paper briefly presents the main technique details of the multi-structure seg-mentation method in MICCAI 2022 KIPA challenge. The main contribution of this paper is that we design the 3D UNet with the large context information cap-turing capability. Our meth…

Implications of computer science theory for the simulation hypothesis
David H. Wolpert
https://arxiv.org/abs/2404.16050 https://arxiv…

Implications of computer science theory for the simulation hypothesis
The simulation hypothesis has recently excited renewed interest, especially in the physics and philosophy communities. However, the hypothesis specifically concerns {computers} that simulate physical universes, which means that to properly investigate it we need to couple computer science theory with physics. Here I do this by exploiting the physical Church-Turing thesis. This allows me to introduce a preliminary investigation of some of the computer science theoretic aspects of the simulation …

This https://arxiv.org/abs/2402.09410 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

On Computability of Computable Problems
Computational problems are classified into computable and uncomputable problems.If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable.Turing machines can execute any algorithm therefore every computable problem is Turing computable.There are some variants of Turing machine that appear computationally more powerful but all these variants have been proven equally powerful.The main objective of this work is to revisit an…

Good stuff by @… on the limits of benchmark testing in AI, and the dangers of overrelying on them and overestimating their value.
https://sigmoid.social/@…

AI Consciousness is Inevitable: A Theoretical Computer Science Perspective
Lenore Blum, Manuel Blum
https://arxiv.org/abs/2403.17101 https://

AI Consciousness is Inevitable: A Theoretical Computer Science Perspective
We look at consciousness through the lens of Theoretical Computer Science, a branch of mathematics that studies computation under resource limitations. From this perspective, we develop a formal machine model for consciousness. The model is inspired by Alan Turing's simple yet powerful model of computation and Bernard Baars' theater model of consciousness. Though extremely simple, the model aligns at a high level with many of the major scientific theories of human and animal consciousness, supp…

A framework to identify supercritical and subcritical Turing bifurcations: Case study of a system sustaining cubic and quadratic autocatalysis
Deepak Kumar, Subramaniam Pushpavanam
https://arxiv.org/abs/2403.17386

A framework to identify supercritical and subcritical Turing bifurcations: Case study of a system sustaining cubic and quadratic autocatalysis
In this work, we focus on an autocatalytic reaction-diffusion model and carry out multiple scale weakly nonlinear analysis. A cubic and a quadratic autocatalytic reaction system is analysed. We develop a framework to identify the critical surfaces in parameter space across which the nature of the Turing bifurcation changes from supercritical to subcritical. These are verified by direct numerical simulations of the system. Using weakly nonlinear analysis, we derive equations up to the fifth orde…

Turing pattern theory on homogeneous and heterogeneous higher-order temporal network system
Junyuan Shi
https://arxiv.org/abs/2402.15736 https://

Turing pattern theory on homogeneous and heterogeneous higher-order temporal network system
Reaction-diffusion processes on networked systems have received mounting attention in the past two decades, and the corresponding network dynamics theories have been continuously enriched with the advancement of network science. Recently, time-varying feature and many-body interactions have been discovered on various and numerous networks in real world like biological and social systems, and the study of contemporary network science has gradually moved away from the historically static network …

@… let’s mechanical turk it—I put my turing test down flip it and reverse it

The Year of Open Science, Culminating Conference recordings are out!
You can hear me, and fantastic other panelists!, speak in the session on: The Turing Way: Aligning Professional Roles and Incentives with Open Research session: #OpenScience
#YearOfOpenScience
#TIR @…
1/n

Logical Characterizations of Weighted Complexity Classes
Guillermo Badia, Manfred Droste, Carles Noguera, Eirk Paul
https://arxiv.org/abs/2404.17784 https:…

Logical Characterizations of Weighted Complexity Classes
Fagin's seminal result characterizing $\mathsf{NP}$ in terms of existential second-order logic started the fruitful field of descriptive complexity theory. In recent years, there has been much interest in the investigation of quantitative (weighted) models of computations. In this paper, we start the study of descriptive complexity based on weighted Turing machines over arbitrary semirings. We provide machine-independent characterizations (over ordered structures) of the weighted complexity cla…

This https://arxiv.org/abs/2404.12934 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

AuDaLa is Turing Complete
AuDaLa is a recently introduced programming language that follows the new data autonomous paradigm. In this paradigm, small pieces of data execute functions autonomously. Considering the paradigm and the design choices of AuDaLa, it is interesting to determine the expressiveness of the language and to create verification methods for it. In this paper, we take our first steps to such a verification method by implementing Turing machines in AuDaLa and proving that implementation correct. This als…

This https://arxiv.org/abs/2309.02956 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Predicting the emergence of localised dihedral patterns in models for dryland vegetation
Localised patterns are often observed in models for dryland vegetation, both as peaks of vegetation in a desert state and as gaps within a vegetated state, known as `fairy circles'. Recent results from radial spatial dynamics show that approximations of localised patterns with dihedral symmetry emerge from a Turing instability in general reaction--diffusion systems, which we apply to several vegetation models. We present a systematic guide for finding such patterns in a given reaction--diffusio…

When you point at cat food, the cat looks at your fingertip, not in the direction that you are pointing. All intelligent "systems", artificial and biological, have severe limitations w.r.t. intelligence. Sensory substitution is an area where humans thus far struggle to show much general intelligence.

Dr. Jeffrey Funk on LinkedIn: Meta’s A.I. Chief Yann LeCun Explains Why a House Cat Is Smarter Than The… | 29 comments
Yann LeCun, chief AI scientist and winner of the Turing award, believes the widespread fear that powerful AI models “are dangerous is largely imaginary… | 29 comments on LinkedIn

Darwin Turing Dawkins: Building a General Theory of Evolution
Leonard M. Adleman
https://arxiv.org/abs/2402.10393 https://arxiv.org/p…

Darwin Turing Dawkins: Building a General Theory of Evolution
Living things, computers, societies, and even books are part of a grand evolutionary struggle to survive. That struggle shapes nature, nations, religions, art, science, and you. What you think, feel, and do is determined by it. Darwinian evolution does not apply solely to the genes that are stored in DNA. Using the insights of Alan Turing and Richard Dawkins, we will see that it also applies to the memes we store in our brains and the information we store in our computers. The next time you run…

This board game is awesome!! (Turing Machine)

If Turing played piano with an artificial partner
Dobromir Dotov, Dante Camarena, Zack Harris, Joanna Spyra, Pietro Gagliano, Laurel Trainor
https://arxiv.org/abs/2402.08690

If Turing played piano with an artificial partner
Music is an inherently social activity that allows people to share experiences and feel connected with one another. There has been little progress in designing artificial partners exhibiting a similar social experience as playing with another person. Neural network architectures that implement generative models, such as large language models, are suited for producing musical scores. Playing music socially, however, involves more than playing a score; it must complement the other musicians' idea…

Philip Wadler on Church, Gödel, Turing, the halting problem and the barber's paradoxe
https://chtbl.com/track/7D91G/traffic.libsyn.com/secure/corecursive/021_-_Gods_Programming_Language.mp3

Shitposting as code...
"Generic POSIX printf itself can be Turing complete as shown in Control-Flow Bending. Here we take printf-oriented programming one step further and preset a brainfuck interpreter inside a single printf statement."
https://github.com/HexHive/printbf

During our first set of user tests of the AutSPACEs prototype one participant mused that an RSS feed for subscribing to new contributions would be great.
And of course that had to nerd-snipe me, to see how hard an MVP of that would be 😂
#citizenscience

Computable domains of a Halting Function
Abel Luis Peralta
https://arxiv.org/abs/2404.09484 https://arxiv.org/pdf/2404.09484

Computable domains of a Halting Function
We discuss the possibility of constructing a function that validates the definition or not definition of the partial recursive functions of one variable. This is a topic in computability theory, which was first approached by Alan M. Turing in 1936 in his foundational work "On Computable Numbers". Here we face it using the Model of computability of the recursive functions instead of the Turing's machines, but the results are transferable from one to another paradigm with ease. Recursive function…

The Last Coyote (Harry Bosch #4), by Michael Connelly
https://turing.mailstation.de/the-last-coyote-harry-bosch-4-by-michael-connelly/?feed_id=3219&_unique_id=662ba860a4a16

The Year of Open Science, Culminating Conference recordings are out!
You can hear me, and fantastic other panelists!, speak in the session on: The Turing Way: Aligning Professional Roles and Incentives with Open Research session: #OpenScience
#YearOfOpenScience
#TIR @…
1/n

This https://arxiv.org/abs/2301.10637 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Complexity of Geometric programming in the Turing model and application to nonnegative tensors
We consider a geometric programming problem consisting in minimizing a function given by the supremum of finitely many log-Laplace transforms of discrete nonnegative measures on a Euclidean space. Under a coerciveness assumption, we show that a $\varepsilon$-minimizer can be computed in a time that is polynomial in the input size and in $|\log\varepsilon|$. This is obtained by establishing bit-size estimates on approximate minimizers and by applying the ellipsoid method. We also deriv…

This https://arxiv.org/abs/2403.04254 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Finite final segments of the d.c.e. Turing degrees
We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the EAE-theory of the d.c.e. degrees in the language of partial ordering.

"The Z3 was the first Turing-complete machine, and Zuse went on to write the first computer chess program in the first high-level programming language Plankalkül, a language of his own devising and an unacknowledged forerunner to ALGOL. This was all part of his PhD thesis, but having failed to pay the submission fee to the University of Augsburg he did not obtain a degree."

On Research Software Engineering
Let's be plain upfront: academia dropped the ball on software engineering. Go back to the genesis of the field, and you see that computing was being advanced mostly by needs in the public sector, with the private sector playing a role. The first publicly demonstrated computer was produced by Konrad Zuse in 1941, and marketed by his company Zuse Apparatebau. But it was actually funded by the Nazi government in Germany, specifically the aerodynamic research institute, for its use in designing and…

This https://arxiv.org/abs/2402.12130 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAR_…

Factor Machine: Mixed-signal Architecture for Fine-Grained Graph-Based Computing
This paper proposes the design and implementation strategy of a novel computing architecture, the Factor Machine. The work is a step towards a general-purpose parallel system operating in a non-sequential manner, exploiting processing/memory co-integration and replacing the traditional Turing/von Neumann model of a computer system with a framework based on "factorised computation". This architecture is inspired by neural information processing principles and aims to progress the development of …

The Turing Pattern Transition with the Growing Domain and Metabolic Rate Effects
Shin Nishihara, Toru Ohira
https://arxiv.org/abs/2403.05741 https://

The Turing Pattern Transition with the Growing Domain and Metabolic Rate Effects
The present study investigates the phenomenon of pattern transitions on the body surfaces of mammals during their transition from juveniles to adults and with seasonal changes. Our previous research suggests that patterns formed during infancy may disperse due to the growing domain (GD) effects, but their transition is sensitive to parameter values. Thus, in the present study, we focus on a factor that can change due to domain growth, such as heat. Generally, the greater the ratio of surface ar…

Darwin Turing Dawkins: Building a General Theory of Evolution
Leonard M. Adleman
https://arxiv.org/abs/2402.10393 https://arxiv.org/p…

Darwin Turing Dawkins: Building a General Theory of Evolution
Living things, computers, societies, and even books are part of a grand evolutionary struggle to survive. That struggle shapes nature, nations, religions, art, science, and you. What you think, feel, and do is determined by it. Darwinian evolution does not apply solely to the genes that are stored in DNA. Using the insights of Alan Turing and Richard Dawkins, we will see that it also applies to the memes we store in our brains and the information we store in our computers. The next time you run…

The word problem and growth of groups
Ievgen Bondarenko
https://arxiv.org/abs/2403.11148 https://arxiv.org/pdf/2403.11148

The word problem and growth of groups
Let $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of languages solved in time $O(t(n))$ by a Turing machine with $k$ tapes. We prove that $\mathrm{WP}_G\in\mathrm{DTIME}_1(n\log n)$ if and only if $G$ is virtually nilpotent. We relate the complexity of the word problem and the growth of groups by showing that $\ma…

Shitposting as code...
"Generic POSIX printf itself can be Turing complete as shown in Control-Flow Bending. Here we take printf-oriented programming one step further and preset a brainfuck interpreter inside a single printf statement."
https://github.com/HexHive/printbf

Rate-independent continuous inhibitory chemical reaction networks are Turing-universal
Kim Calabrese, David Doty
https://arxiv.org/abs/2403.07099 https://<…

Rate-independent continuous inhibitory chemical reaction networks are Turing-universal
We study the model of continuous chemical reaction networks (CRNs), consisting of reactions such as $A+B \to C+D$ that can transform some continuous, nonnegative real-valued quantity (called a *concentration*) of chemical species $A$ and $B$ into equal concentrations of $C$ and $D$. Such a reaction can occur from any state in which both reactants $A$ and $B$ are present, i.e., have positive concentration. We modify the model to allow *inhibitors*, for instance, reaction $A+B \to^{I} C+D$ can oc…

Existentialism Is a Humanism, by Jean-Paul Sartre
https://turing.mailstation.de/existentialism-is-a-humanism-by-jean-paul-sartre/?feed_id=3177&_unique_id=66252f14647c5

Emergence of rogue-like waves in a reaction-diffusion system: Stochastic output from deterministic dynamics
Edgar Knobloch, Arik Yochelis
https://arxiv.org/abs/2402.18349

Emergence of rogue-like waves in a reaction-diffusion system: Stochastic output from deterministic dynamics
Rogue waves are an intriguing nonlinear phenomenon arising across different scales, ranging from ocean waves through optics to Bose-Einstein condensate. We describe the emergence of rogue wave-like dynamics in a reaction-diffusion system that arise as a result of a subcritical Turing instability. This state is present in the regime where all time-independent states are unstable, and consists of intermittent excitation of spatially localized spikes, followed by collapse to an unstable state and …

"The Z3 was the first Turing-complete machine, and Zuse went on to write the first computer chess program in the first high-level programming language Plankalkül, a language of his own devising and an unacknowledged forerunner to ALGOL. This was all part of his PhD thesis, but having failed to pay the submission fee to the University of Augsburg he did not obtain a degree."

On Research Software Engineering
Let's be plain upfront: academia dropped the ball on software engineering. Go back to the genesis of the field, and you see that computing was being advanced mostly by needs in the public sector, with the private sector playing a role. The first publicly demonstrated computer was produced by Konrad Zuse in 1941, and marketed by his company Zuse Apparatebau. But it was actually funded by the Nazi government in Germany, specifically the aerodynamic research institute, for its use in designing and…

Just Wing It: Optimal Estimation of Missing Mass in a Markovian Sequence
Ashwin Pananjady, Vidya Muthukumar, Andrew Thangaraj
https://arxiv.org/abs/2404.05819

Just Wing It: Optimal Estimation of Missing Mass in a Markovian Sequence
We study the problem of estimating the stationary mass -- also called the unigram mass -- that is missing from a single trajectory of a discrete-time, ergodic Markov chain. This problem has several applications -- for example, estimating the stationary missing mass is critical for accurately smoothing probability estimates in sequence models. While the classical Good--Turing estimator from the 1950s has appealing properties for i.i.d. data, it is known to be biased in the Markov setting, and ot…

Generalized Straight-Line Programs
Gonzalo Navarro, Francisco Olivares, Cristian Urbina
https://arxiv.org/abs/2404.07057 https://arxi…

Generalized Straight-Line Programs
It was recently proved that any Straight-Line Program (SLP) generating a given string can be transformed in linear time into an equivalent balanced SLP of the same asymptotic size. We generalize this proof to a general class of grammars we call Generalized SLPs (GSLPs), which allow rules of the form $A \rightarrow x$ where $x$ is any Turing-complete representation (of size $|x|$) of a sequence of symbols (potentially much longer than $|x|$). We then specialize GSLPs to so-ca…

Finite final segments of the d.c.e. Turing degrees
Steffen Lempp, Yiqun Liu, Yong Liu, Keng Meng Ng, Cheng Peng, Guohua Wu
https://arxiv.org/abs/2403.04254

Finite final segments of the d.c.e. Turing degrees
We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets).

Lovers at the Museum, by Isabel Allende
https://turing.mailstation.de/lovers-at-the-museum-by-isabel-allende/?feed_id=3159&_unique_id=66238205ad86f

This https://arxiv.org/abs/1908.06324 has been replaced.
link: https://scholar.google.com/scholar?q=a

Dynamics of neural fields with exponential temporal kernel
We consider the standard neural field equation with an exponential temporal kernel. We analyze the time-independent (static) and time-dependent (dynamic) bifurcations of the equilibrium solution and the emerging spatiotemporal wave patterns. We show that an exponential temporal kernel does not allow static bifurcations such as saddle-node, pitchfork, and in particular, static Turing bifurcations. However, the exponential temporal kernel possesses the important property that it takes into accoun…

Factor Machine: Mixed-signal Architecture for Fine-Grained Graph-Based Computing
Pitr Dudek
https://arxiv.org/abs/2402.12130 https://…

Factor Machine: Mixed-signal Architecture for Fine-Grained Graph-Based Computing
This paper proposes the design and implementation strategy of a novel computing architecture, the Factor Machine. The work is a step towards a general-purpose parallel system operating in a non-sequential manner, exploiting processing/memory co-integration and replacing the traditional Turing/von Neumann model of a computer system with a framework based on "factorised computation". This architecture is inspired by neural information processing principles and aims to progress the development of …

Can't help but feel that this ‘pre-announcement’ of AI funding for the Turing was planted to distract from other things. 🙈 Also c.f. the "dead cat strategy”. https://en.wikipedia.org/wiki/Dead_cat_strategy

This https://arxiv.org/abs/1903.08945 has been replaced.
link: https://scholar.google.com/scholar?q=a

A Note on OTM-Realizability and Constructive Set Theories
We define an ordinalized version of Kleene's realizability interpretation of intuitionistic logic by replacing Turing machines with Koepke's ordinal Turing machines (OTMs), thus obtaining a notion of realizability applying to arbitrary statements in the language of set theory. We observe that every instance of the axioms of intuitionistic first-order logic are OTM-realizable and consider the question which axioms of Friedman's Intuitionistic Set Theory (IZF) and Aczel's Constructive Set Theory …

Xerox, von Fien Veldman
#Buch

This https://arxiv.org/abs/2307.11747 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
We prove that functions over the reals computable in polynomial time can be characterised using discrete ordinary differential equations (ODE), also known as finite differences. We also provide a characterisation of functions computable in polynomial space over the reals. In particular, this covers space complexity, while existing characterisations were only able to cover time complexity, and were restricted to functions over the integers. We prove furthermore that no artificial sign or test …

This https://arxiv.org/abs/1903.08945 has been replaced.
link: https://scholar.google.com/scholar?q=a

A Note on OTM-Realizability and Constructive Set Theories
We define an ordinalized version of Kleene's realizability interpretation of intuitionistic logic by replacing Turing machines with Koepke's ordinal Turing machines (OTMs), thus obtaining a notion of realizability applying to arbitrary statements in the language of set theory. We observe that every instance of the axioms of intuitionistic first-order logic are OTM-realizable and consider the question which axioms of Friedman's Intuitionistic Set Theory (IZF) and Aczel's Constructive Set Theory …

Rate-independent continuous inhibitory chemical reaction networks are Turing-universal
Kim Calabrese, David Doty
https://arxiv.org/abs/2403.07099 https://<…

Rate-independent continuous inhibitory chemical reaction networks are Turing-universal
We study the model of continuous chemical reaction networks (CRNs), consisting of reactions such as $A+B \to C+D$ that can transform some continuous, nonnegative real-valued quantity (called a *concentration*) of chemical species $A$ and $B$ into equal concentrations of $C$ and $D$. Such a reaction can occur from any state in which both reactants $A$ and $B$ are present, i.e., have positive concentration. We modify the model to allow *inhibitors*, for instance, reaction $A+B \to^{I} C+D$ can oc…

#Avi #Wigderson is the recipient of the 2023 ACM A.M. #Turing #Award.
Wigderson's groundbreaking contributions to theoretical computer science…

Avi Wigderson
ACM Award Recipient page

On the speed of propagation in Turing patterns for reaction-diffusion systems
V\'aclav Klika, Eamonn A. Gaffney, Philip K. Maini
https://arxiv.org/abs/2403.09247

On the speed of propagation in Turing patterns for reaction-diffusion systems
This study investigates transient wave dynamics in Turing pattern formation, focusing on waves emerging from localised disturbances. While the traditional focus of diffusion-driven instability has primarily centred on stationary solutions, considerable attention has also been directed towards understanding spatio-temporal behaviours, particularly the propagation of patterning from localised disturbances. We analyse these waves of patterning using both the well-established marginal stability cri…

Godkiller (Fallen Gods, #1), by Hannah Kaner
https://turing.mailstation.de/godkiller-fallen-gods-1-by-hannah-kaner/?feed_id=3099&_unique_id=661d5d143040b

Toasty (Cozy #2), by Alexa Riley
https://turing.mailstation.de/toasty-cozy-2-by-alexa-riley/?feed_id=2900&_unique_id=65cca6f432dd1

Face Her Fear (Detective Josie Quinn #19), by Lisa Regan
https://turing.mailstation.de/face-her-fear-detective-josie-quinn-19-by-lisa-regan/?feed_id=2890&_unique_id=65cb74f6aec7e

Weakly nonlinear analysis of Turing pattern dynamics on curved surfaces
Ryosuke Nishide, Shuji Ishihara
https://arxiv.org/abs/2403.12444 https://

Weakly nonlinear analysis of Turing pattern dynamics on curved surfaces
Pattern dynamics on curved surfaces are ubiquitous. Although the effect of surface topography on pattern dynamics has gained much interest, there is a limited understanding of the roles of surface geometry and topology in pattern dynamics. Recently, we reported that a static pattern on a flat plane can become a propagating pattern on a curved surface [Nishide and Ishihara, Phys. Rev. Lett. 2022]. By examining reaction-diffusion equations on axisymmetric surfaces, certain conditions for the onse…

Consciousness qua Mortal Computation
Johannes Kleiner
https://arxiv.org/abs/2403.03925 https://arxiv.org/pdf/2403.03925

Consciousness qua Mortal Computation
Computational functionalism posits that consciousness is a computation. Here we show, perhaps surprisingly, that it cannot be a Turing computation. Rather, computational functionalism implies that consciousness is a novel type of computation that has recently been proposed by Geoffrey Hinton, called mortal computation.

This https://arxiv.org/abs/2305.19646 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Part 1 of Martin's Conjecture for order-preserving and measure-preserving functions
Martin's Conjecture is a proposed classification of the definable functions on the Turing degrees. It is usually divided into two parts, the first of which classifies functions which are not above the identity and the second of which classifies functions which are above the identity. Slaman and Steel proved the second part of the conjecture for Borel functions which are order-preserving (i.e. which preserve Turing reducibility). We prove the first part of the conjecture for all order-preserving…

This https://arxiv.org/abs/2104.14316 has been replaced.
link: https://scholar.google.com/scholar?q=a

Separation of PSPACE and EXP
This article shows that PSPACE not equal EXP. A simple but novel proof technique has been used to separate these two classes. Whether an arbitrary Turing machine accepts an input when the running time is limited has been computed in this paper. Then, the limit goes to infinity. Thus, methods of the recursion theory can be applied to problems of computational complexity theory without violating the relativization barrier.

Chocolat (Chocolat #1), by Joanne Harris
https://turing.mailstation.de/chocolat-chocolat-1-by-joanne-harris/?feed_id=2880&_unique_id=65c8ba34a424d

This https://arxiv.org/abs/2403.12444 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_nli…

Weakly nonlinear analysis of Turing pattern dynamics on curved surfaces
Pattern dynamics on curved surfaces are ubiquitous. Although the effect of surface topography on pattern dynamics has gained much interest, there is a limited understanding of the roles of surface geometry and topology in pattern dynamics. Recently, we reported that a static pattern on a flat plane can become a propagating pattern on a curved surface [Nishide and Ishihara, Phys. Rev. Lett. 2022]. By examining reaction-diffusion equations on axisymmetric surfaces, certain conditions for the onse…

This https://arxiv.org/abs/2208.08656 has been replaced.
link: https://scholar.google.com/scholar?q=a

Categorifying computable reducibilities
This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation, essentially dualizing the traditional notion of realizability doctrines, Weihrauch reducibility and its extensions for represented and multi-represented spaces require a thorough investigation and the formulation of a new appropriate extension of the category of …

Nolyn (The Rise and Fall, #1), by Michael J. Sullivan
https://turing.mailstation.de/nolyn-the-rise-and-fall-1-by-michael-j-sullivan/?feed_id=2911&_unique_id=65ec3cc6c9121

This https://arxiv.org/abs/2104.14316 has been replaced.
link: https://scholar.google.com/scholar?q=a

Separation of PSPACE and EXP
This article shows that PSPACE not equal EXP. A simple but novel proof technique has been used to separate these two classes. Whether an arbitrary Turing machine accepts an input when the running time is limited has been computed in this paper. Then, the limit goes to infinity. Thus, methods of the recursion theory can be applied to problems of computational complexity theory without violating the relativization barrier.

This https://arxiv.org/abs/2208.08656 has been replaced.
link: https://scholar.google.com/scholar?q=a

Categorifying computable reducibilities
This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation, essentially dualizing the traditional notion of realizability doctrines, Weihrauch reducibility and its extensions for represented and multi-represented spaces require a thorough investigation and the formulation of a new appropriate extension of the category of …

The Seven Brides-to-Be of Generalissimo Vlad, by Victoria Goddard
https://turing.mailstation.de/the-seven-brides-to-be-of-generalissimo-vlad-by-victoria-goddard/?feed_id=3026&_unique_id=…

You, with a View, by Jessica Joyce
https://turing.mailstation.de/you-with-a-view-by-jessica-joyce/?feed_id=2973&_unique_id=660ed11b8c794

Almost sure OTM-realizability
Merlin Carl
https://arxiv.org/abs/2403.10280 https://arxiv.org/pdf/2403.10280

Almost sure OTM-realizability
Combining the approaches made in works with Galeotti and Passmann, we define and study a notion of "almost sure" realizability with parameter-free ordinal Turing machines (OTMs). In particular, we show that, in contrast to the classical case, almost sure realizability differs from plain realizability, while closure under intuitionistic predicate logic and realizability of Kripke-Platek set theory continue to hold.

Worst Wingman Ever (The Improbable Meet-Cute #2), by Abby Jimenez
https://turing.mailstation.de/worst-wingman-ever-the-improbable-meet-cute-2-by-abby-jimenez/?feed_id=2995&_unique_id=660ffc…

Frequency Comb Enhancement via the Self-Crystallization of Vectorial Cavity Solitons
Graeme Neil Campbell, Lewis Hill, Pascal Del'Haye, Gian-Luca Oppo
https://arxiv.org/abs/2403.16547

Frequency Comb Enhancement via the Self-Crystallization of Vectorial Cavity Solitons
Long range interactions between dark vectorial temporal cavity solitons are induced though the spontaneous symmetry breaking of orthogonally polarized fields in ring resonators. Turing patterns of alternating polarizations form between adjacent solitons, pushing them apart so that a random distribution of solitons along the cavity length reaches equal equilibrium distances. Enhancement of the frequency comb is achieved through the spontaneous formation of regularly spaced soliton crystals, 'sel…

The complexity of computing in continuous time: space complexity is precision
Manon Blanc, Olivier Bournez
https://arxiv.org/abs/2403.02499 https://…

The complexity of computing in continuous time: space complexity is precision
Models of computations over the integers are equivalent from a computability and complexity theory point of view by the Church-Turing thesis. It is not possible to unify discrete-time models over the reals. The situation is unclear but simpler for continuous-time models, as there is a unifying mathematical model provided by ordinary differential equations (ODEs). For example, the GPAC model of Shannon is known to correspond to polynomial ODEs. However, the question of a robust complexity theory…

Localized Multi-Dimensional Patterns
Jason J. Bramburger, Dan J. Hill, David J. B. Lloyd
https://arxiv.org/abs/2404.14987 https://arx…

Localized Multi-Dimensional Patterns
Localized patterns are coherent structures embedded in a quiescent state and occur in both discrete and continuous media across a wide range of applications. While it is well-understood how domain covering patterns (for example stripes and hexagons) emerge from a pattern-forming/Turing instability, analyzing the emergence of their localized counterparts remains a significant challenge. There has been considerable progress in studying localized patterns over the past few decades, often by employ…

Extended generalized recurrence plot quantification of complex circular patterns
Maik Riedl, Norbert Marwan, J\"urgen Kurths
https://arxiv.org/abs/2402.10942

Extended generalized recurrence plot quantification of complex circular patterns
The generalized recurrence plot is a modern tool for quantification of complex spatial patterns. Its application spans the analysis of trabecular bone structures, Turing patterns, turbulent spatial plankton patterns, and fractals. Determinism is a central measure in this framework quantifying the level of regularity of spatial structures. We show by basic examples of fully regular patterns of different symmetries that this measure underestimates the orderliness of circular patterns resulting fr…

Two results on complexities of decision problems of groups
Uri Andrews, Matthew Harrison-Trainor, Meng-Che "Turbo" Ho
https://arxiv.org/abs/2403.02492

Two results on complexities of decision problems of groups
We answer two questions on the complexities of decision problems of groups, each related to a classical result. First, C. Miller characterized the complexity of the isomorphism problem for finitely presented groups in 1971. We do the same for the isomorphism problem for recursively presented groups. Second, the fact that every Turing degree appears as the degree of the word problem of a finitely presented group is shown independently by multiple people in the 1960s. We answer the analogous ques…

Implications of tristability on localization phenomena: a necking bifurcation's tale
Edem Kossi Akakpo, Marc Haelterman, Francois Leo, Pedro Parra-Rivas
https://arxiv.org/abs/2403.07814

Implications of tristability on localization phenomena: a necking bifurcation's tale
We analyze the implication of tristability on localization phenomena in one-dimensional extended dissipative systems. In this context, localized states appear due to the interaction and locking of front waves connecting different extended states. In the tristable regime investigated here two extended uniform states coexist with one periodic Turing pattern. This scenario leads to the transition from the standard-homoclinic-snaking-related localized states associated with uniform-pattern bistabil…