The following pages link to (Q3686043):
Displayed 36 items.
- Retracted: Universal computation is `almost surely' chaotic (Q403026) (← links)
- Secure multiparty computation of solid geometric problems and their applications (Q507770) (← links)
- Distributed dynamic mobile multicast (Q635405) (← links)
- The expressiveness of a family of finite set languages (Q672126) (← links)
- Training digraphs (Q674181) (← links)
- On the decidability of open logic (Q848254) (← links)
- The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words (Q886315) (← links)
- Murg term rewrite systems (Q975468) (← links)
- Collapsing degrees (Q1109766) (← links)
- Optimizing propositional calculus formulas with regard to questions of deducibility (Q1117918) (← links)
- Small universal Turing machines (Q1349852) (← links)
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334) (← links)
- On the computational power of context-free PC grammar systems (Q1566712) (← links)
- Cellular telephone networks and random maps in hypergraphs (Q1570826) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- Higher type recursion, ramification and polynomial time (Q1577477) (← links)
- Parikh-reducing Church-Rosser representations for some classes of regular languages (Q1676318) (← links)
- Elementary functions and loop programs (Q1903128) (← links)
- Arrow's theorem, countably many agents, and more visible invisible dictators (Q1961954) (← links)
- Computable preference and utility (Q1961959) (← links)
- The origins of the halting problem (Q2043819) (← links)
- Non-perturbative graph languages, halting problem and complexity (Q2171907) (← links)
- The Boolean satisfiability problem in Clifford algebra (Q2317865) (← links)
- Computing queries with higher-order logics (Q2369013) (← links)
- Simulating Turing machines on Maurer machines (Q2480963) (← links)
- Model checking for process rewrite systems and a class of action-based regular properties (Q2503332) (← links)
- Undecidability in <b>R</b><sup><i>n</i></sup>: Riddled Basins, the KAM Tori, and the Stability of the Solar System (Q3093489) (← links)
- My Life as a Logician (Q3305314) (← links)
- (Q3994022) (← links)
- The Smyth Completion (Q4222778) (← links)
- The Generalized Nagell–Ljunggren Problem: Powers with Repetitive Representations (Q4972537) (← links)
- Conditional semi-Thue systems for presenting monoids (Q5096810) (← links)
- The symmetric Post Correspondence Problem, and errata for the freeness problem for matrix semigroups (Q5097713) (← links)
- On the expressibility and the computability of untyped queries (Q5936000) (← links)
- A new approach for the execution and adjustment of a fuzzy algorithm (Q5947560) (← links)
- Verification-Led Smart Contracts (Q6166532) (← links)