Finite Computational Structures and Implementations

@article{EgriNagy2016FiniteCS,
  title={Finite Computational Structures and Implementations},
  author={Attila Egri-Nagy},
  journal={2016 Fourth International Symposium on Computing and Networking (CANDAR)},
  year={2016},
  pages={119-125}
}
  • A. Egri-Nagy
  • Published 19 October 2016
  • Computer Science, Mathematics
  • 2016 Fourth International Symposium on Computing and Networking (CANDAR)
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… 
The Algebraic View of Computation
TLDR
Computational implementations are special relations between what is computed and what computes it, and the algebraic approach sheds light on the interplay between time and computation.
The Algebraic View of Computation : Implementation , Interpretation and Time
Computational implementations are special relations between what is computed and what computes it. Though the word “isomorphism” appears in philosophical discussions about the nature of

References

SHOWING 1-10 OF 33 REFERENCES
Computability: An Introduction to Recursive Function Theory
Preface Prologue, prerequisites and notation 1. Computable functions 2. Generating computable functions 3. Other approaches to computability: Church's thesis 4. Numbering computable functions 5.
Reversible Computing
TLDR
According to a physical interpretation, the central result of this paper is that i¢ is ideally possible to build sequential c/rcuits with zero internal power dissipation.
On Computable Numbers, with an Application to the Entscheidungsproblem
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. Abbreviated
A Physically Universal Cellular Automaton
TLDR
The first known example of a physically universal CA is given, answering an open problem of Janzing and opening the way for further research in this area.
Finite Diagram Semigroups: Extending the Computational Horizon
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a
Transformation Semigroups as Constructive Dynamical Spaces
TLDR
After explaining how semigroups can be seen as constructive dynamical spaces, it is shown how John Rhodes’s formalism can be used to define an Interaction Machine and provided a conceptual discussion of its possible architecture based on Rhodes's analysis of cell metabolism.
Deciding Associativity for Partial Multiplication Tables of Order 3
The associativity problem for the class of finite multiplication tables is known to be undecidable, even for quite narrow infinite subclasses of tables. We present cri- teria which can be used to
A Computer Scientist's View of Life, the Universe, and Everything
Is the universe computable? If so, it may be much cheaper in terms of information requirements to compute all computable universes instead of just ours. I apply basic concepts of Kolmogorov
Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions
TLDR
The goals of this work are to identify and understand mathematically the natural subsystems and hierarchical relations in natural systems enabling this and use the resulting insights to define a new model of computation based on interactions that is useful for both biology and computation.
The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine
TLDR
The author elaborates on and clarifies many of Turings statements, making the original difficult-to-read document accessible to present day programmers, computer science majors, math geeks, and others.
...
1
2
3
4
...