
Reversible cellular automata in presence of noise rapidly forget everything
We consider reversible and surjective cellular automata perturbed with n...
read it

Foreword: A Computable Universe, Understanding Computation and Exploring Nature As Computation
I am most honoured to have the privilege to present the Foreword to this...
read it

The Algebraic View of Computation
We argue that computation is an abstract algebraic concept, and a comput...
read it

Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence
Computing theory analyzes abstract computational models to rigorously st...
read it

Computing and Proving Wellfounded Orderings through Finite Abstractions
A common technique for checking properties of complex state machines is ...
read it

The Modern Mathematics of Deep Learning
We describe the new field of mathematical analysis of deep learning. Thi...
read it

Profunctor optics and traversals
Optics are bidirectional accessors of data structures; they provide a po...
read it
Finite Computational Structures and Implementations
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only partial answers to these questions. In order to make these problems more precise, we describe an abstract algebraic definition of classical computation, generalizing traditional models to semigroups. The mathematical abstraction also allows the investigation of different computing paradigms (e.g. cellular automata, reversible computing) in the same framework. Here we summarize the main questions and recent results of the research of finite computation.
READ FULL TEXT
Comments
There are no comments yet.