Temporal-Lobe
发表于 2025-3-25 04:37:11
Monadic Computation and Iterative Algebraic Theoriesequationally definable classes of algebras from a more intrinsic point of view. We make use of it to study Turing machines and machines with a similar kind of control at a level of abstraction which disregards the nature of ‘storage’ or ‘external memory’.
严峻考验
发表于 2025-3-25 09:12:16
http://reply.papertrans.cn/87/8642/864186/864186_22.png
不能和解
发表于 2025-3-25 12:18:41
http://reply.papertrans.cn/87/8642/864186/864186_23.png
反馈
发表于 2025-3-25 19:21:14
Vector Iteration in Pointed Iterative Theories iteration operations, SIAM J. Comput., 9 (1980), pp. 25–45. In that paper it was proved that for each morphism ⊥: 1 → 0 in an iterative theory . there is exactly one extension of the scalar iteration operation in . to all scalar morphisms such that . and all scalar iterative identities remain valid
头盔
发表于 2025-3-25 20:38:33
http://reply.papertrans.cn/87/8642/864186/864186_25.png
得罪
发表于 2025-3-26 00:21:51
A Semantically Meaningful Characterization of Reducible Flowchart Schemes or Hecht and Ullman. We characterize the class of reducible scalar flowchart schemes as the smallest class containing certain members and closed under certain operations (on and to flowchart schemes). These operations are “semantically meaningful” in the sense that operations of the same form are m
灰姑娘
发表于 2025-3-26 04:48:40
An Equational Axiomatization of the Algebra of Reducible Flowchart Schemes. A flowchart scheme F with n begins and p exits is reducible iff both (a) for every vertex v there is a begin-path (i.e. a path from a begin vertex) which ends in v (b) for every closed path C there is a vertex v. of C such that every begin path to a vertex of C meets v.. Algebraically: F is reduci
填满
发表于 2025-3-26 10:56:18
http://reply.papertrans.cn/87/8642/864186/864186_28.png
Preserve
发表于 2025-3-26 16:14:31
An Equational Axiomatization of the Algebra of Reducible Flowchart Schemesified) flowchart schemes by these three operations. The structure freely generated by the set Γ of atomic flowchart schemes is Γ ., the theory (or multi-sorted algebra) of reducible flowchart schemes. The axioms involving only + and ∘ yield Γ., the theory of accessible, acyclic flowchart schemes. Se
抵消
发表于 2025-3-26 18:34:11
On Coordinated Sequential Processeshat each process need read only one binary variable (or register), viz. its own, and write in one, viz. its neighbor’s. The emphasis of our approach is in the mathematical formulation of the problem, and the proof that the solution satisfies the desired properties, rather than in the novelty of the