Pages that link to "Item:Q5738899"
From MaRDI portal
The following pages link to Sequential abstract-state machines capture sequential algorithms (Q5738899):
Displayed 50 items.
- Concurrent abstract state machines (Q303691) (← links)
- A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis (Q313981) (← links)
- ASM-based formal design of an adaptivity component for a cloud system (Q315283) (← links)
- A logic for secure memory access of abstract state machines (Q555787) (← links)
- Information systems in modeling interactive computations on granules (Q642541) (← links)
- In some curved spaces, one can solve NP-hard problems in polynomial time (Q843612) (← links)
- Can abstract state machines be useful in language theory? (Q880169) (← links)
- The computable kernel of abstract state machines (Q959826) (← links)
- The never-ending recursion (Q1688713) (← links)
- Proving properties of the Chord protocol using the ASM formalism (Q1757159) (← links)
- Abstract state machines: a unifying view of models of computation and of system design frameworks (Q1772776) (← links)
- A unifying logic for non-deterministic, parallel and concurrent abstract state machines (Q1783738) (← links)
- Axiomatization and characterization of BSP algorithms (Q2011205) (← links)
- Is there any real substance to the claims for a ``new computationalism''? (Q2011631) (← links)
- Communities and ancestors associated with Egon Börger and ASM (Q2117583) (← links)
- ASM specification and refinement of a quantum algorithm (Q2117586) (← links)
- What is the natural abstraction level of an algorithm? (Q2117593) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- Computable execution traces (Q2148796) (← links)
- Test generation from event system abstractions to cover their states and transitions (Q2216864) (← links)
- Database query processing using finite cursor machines (Q2272221) (← links)
- Periodicity based decidable classes in a first order timed logic (Q2368906) (← links)
- Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
- A guarded fragment for abstract state machines (Q2567346) (← links)
- Semantic essence of AsmL (Q2571205) (← links)
- Symbioses between mathematical logic and computer science (Q2630825) (← links)
- Execution trace sets for real computation (Q2699944) (← links)
- What Is an Algorithm? (Q2891359) (← links)
- Honest universality (Q2941591) (← links)
- A Proof System with Bounded Non-determinism in Database Transformations (Q3092325) (← links)
- Rete Network Slicing for Model Queries (Q3187807) (← links)
- Axiomatizing Analog Algorithms (Q3188259) (← links)
- Abstract State Machines for Data-Parallel Computing (Q3224004) (← links)
- Honest Computability and Complexity (Q3305319) (← links)
- Three Paths to Effectiveness (Q3586000) (← links)
- ASMs and Operational Algorithmic Completeness of Lambda Calculus (Q3586009) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Abstract State Machines and the Inquiry Process (Q3586012) (← links)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
- When are Two Algorithms the Same? (Q3633205) (← links)
- Programming in logic without logic programming (Q4593027) (← links)
- Algorithms: From Al-Khwarizmi to Turing and Beyond (Q4637216) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Semantics-to-Syntax Analyses of Algorithms (Q4637221) (← links)
- Formalizing Operational Semantic Specifications in Logic (Q4982629) (← links)
- A Behavioural Theory of Recursive Algorithms (Q4988914) (← links)
- (Q5013888) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- A Characterization of Distributed ASMs with Partial-Order Runs (Q5040367) (← links)
- What is the Church-Turing Thesis? (Q5055286) (← links)