Sökning: "Turing complete"
Hittade 3 avhandlingar innehållade orden Turing complete.
1. Impartial Games and Recursive Functions
Sammanfattning : Interest in 2-player impartial games often concerns the famous theory of Sprague-Grundy. In this thesis we study other aspects, bridging some gaps between combinatorial number theory, computer science and combinatorial games. LÄS MER
2. On Modelling and Analysing Concurrent Systems
Sammanfattning : In order to verify program correctness one needs an appropriate programming language, a specification of the program correctness, and some methods to prove the program correct. We examine two of these aspects: a language for writing a particular kind of concurrent programs, that is modelling concurrent systems, and methods to prove certain correctness properties of concurrent programs, that is analysing concurrent systems. LÄS MER
3. Automatic Verification of Petri Netsin a CLP framework
Sammanfattning : This thesis presents an approach to automatic verification of Petri Nets. The method is formulated in a CLP framework and the class of systems we consider is characterized syntactically as a special class of Constraint Logic Programs. The state space of the system in question coincides with the least fixpoint of the program. LÄS MER