scientific article; zbMATH DE number 7167584

MaRDI QIDQ5216076zbMATH OpenFDO

Authors Thomas Given-Wilson

Publication date 14 February 2020

Full work available at URL https://arxiv.org/abs/1404.0545, http://eptcs.web.cse.unsw.edu.au/paper.cgi?ICE2014.4

Mathematics Subject Classification ID

Classical models of computation (Turing machines, etc.) (68Q04) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Concurrent Turing machines
• An abstract concurrent machine for rewriting
• Encoding fairness in a synchronous concurrent program algebra
• Encodings of Turing machines in linear logic
• A formalization of multi-tape Turing machines
• On the complexity of verifying concurrent transition systems
• On the complexity of verifying concurrent transition systems
• Abstract interpretation of trace semantics for concurrent calculi
• Persistent Computations of Turing Machines

Cited in

(2)

• Expressiveness of concurrent intensionality
• Computational requirements hidden behind encodings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216076)