A Behavioural Theory of Recursive Algorithms

@inproceedings{Borger2020ABT,
  title={A Behavioural Theory of Recursive Algorithms},
  author={E. Borger and Klaus-Dieter Schewe Universita di Pisa and D. Informatica and Pisa and Italy Zhejiang University and Uiuc Institute and Haining and China},
  year={2020}
}
“What is an algorithm?” is a fundamental question of computer science. Gurevich’s behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives an abstract answer without referring to a particular language or programming style, and shows that sequential algorithms are captured by sequential Abstract State Machines. Moschovakis criticised that recursive algorithms such as mergesort are not covered by this theory, but can be expressed by recursors. In this article we propose a… Expand
A Characterization of Distributed ASMs with Partial-Order Runs
TLDR
A concept of concurrent runs of multi-agent ASMs is defined and could show that concurrent ASMs capture a natural language-independent axiomatic definition of concurrent algorithms, thus generalising Gurevich’s seminal ‘Sequential ASM Thesis’ from sequential to concurrent algorithms. Expand
Computation on Structures - The Challenge of Seamless Integration of Theory and Rigorous Scientific Practice
  • K. Schewe
  • Computer Science
  • Frontiers in Computer Science
  • 2021
TLDR
The key challenge for theoretical computer science is to provide the necessary scientific foundations centered around computation theory, complexity, and logic, and it has to be ensured that modern computing, in practice with all its facets, is grounded in rigorous scientific methods. Expand
A Complete Bibliography of Publications in Fundamenta Informaticae: (2020–2029)
95]. Abstraction [103]. Accessibility [31]. Action [22]. Actions [107]. Activity [11]. Actors [94]. Adaptive [30]. Additional [66]. agent [59]. Aggregates [80]. Algebra [1]. Algebraic [51, 86].Expand
Computation on Structures - Behavioural Theory, Logic, Complexity
  • K. Schewe
  • Computer Science
  • Logic, Computation and Rigorous Methods
  • 2021
Insignificant Choice Polynomial Time
  • K. Schewe
  • Computer Science, Mathematics
  • ArXiv
  • 2020
TLDR
An equivalence theorem is proved, which characterises structures that cannot be distinguished by the logic, which implies that SAT cannot be decided by an ICPT computation. Expand

References

SHOWING 1-10 OF 36 REFERENCES
A Behavioural Theory for Reflective Sequential Algorithms
We develop a behavioural theory of reflective sequential algorithms (RSAs), i.e. algorithms that can modify their own behaviour. The theory comprises a set of language-independent postulatesExpand
Behavioural Theory of Reflective Algorithms I: Reflective Sequential Algorithms
TLDR
A behavioural theory of reflective sequential algorithms (RSAs), i.e. sequential algorithms that can modify their own behaviour, is developed and the proof that all RSAs are captured by this machine model is proved. Expand
A* Algorithm
TLDR
It is argued that the intuitive notion of algorithm does not square with their intuitions about algorithms and the way the authors interpret and apply results about them; to promote the problem of defining algorithms correctly; and to describe briefly a plausible solution. Expand
A new thesis concerning synchronised parallel computing - simplified parallel ASM thesis
TLDR
The article first provides the necessary evidence that the axiomatization presented in this article characterizes indeed the whole class of (synchronous) parallel algorithms, then formally proves that parallel algorithms are captured by Abstract State Machines (ASMs). Expand
Abstract state machines capture parallel algorithms: Correction and extension
TLDR
The parallel thesis for the new, corrected notion of parallel algorithms is proved, and it is checked that parallel ASMs satisfy the new axioms. Expand
Evolving concurrent systems: behavioural theory and logic
TLDR
The behavioural theory implies that concurrent reflective Abstract State Machines (crASMs) can be used as a specification and development language for evolving concurrent systems and a logic for crASMs is investigated, based on the simple observation that concurrent ASMs can be mimicked by non-deterministic parallel ASMs. Expand
Sequential abstract-state machines capture sequential algorithms
TLDR
Analysis of the postulates leads to the notion of sequential abstract-state machine and to the theorem in the title. Expand
What is an algorithm?
TLDR
This may seem to be a strange question to ask just before the Turing Centenary Year, but the question posed by the special CLMPS symposium is an excellent one. Expand
Concurrent abstract state machines
TLDR
The semantics of concurrent ASMs are defined by concurrent ASM runs which overcome the problems of Gurevich's distributed ASM Runs and generalize Lamport's sequentially consistent runs to form a postulate characterizing an intuitive understanding of concurrency. Expand
BSP abstract state machines capture bulk synchronous parallel computations
TLDR
This article presents a behavioural theory for BSP computations comprising an axiomatisation of the BSP model, the definition of a restricted class of concurrent abstract state machines, which are called BSP abstract state Machines, and the proof that BSPstract state machines capture B SP computations as defined by the axiom atisation. Expand
...
1
2
3
4
...