Log In Sign Up

Finite Computational Structures and Implementations

by   Attila Egri-Nagy, et al.

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.


page 1

page 2

page 3

page 4


Reversible cellular automata in presence of noise rapidly forget everything

We consider reversible and surjective cellular automata perturbed with n...

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...

The Algebraic View of Computation

We argue that computation is an abstract algebraic concept, and a comput...

Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence

Computing theory analyzes abstract computational models to rigorously st...

Computing and Proving Well-founded Orderings through Finite Abstractions

A common technique for checking properties of complex state machines is ...

A theory of finite structures

We develop a novel formal theory of finite structures, based on a view o...