Pages that link to "Item:Q703844"

The following pages link to Turing machines, transition systems, and interaction (Q703844):

Displaying 22 items.

• Reactive Turing machines (Q393091) (← links)
• Information systems in modeling interactive computations on granules (Q642541) (← links)
• Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
• Expressive power of first-order recurrent neural networks determined by their attractor dynamics (Q736603) (← links)
• On the computing power of fuzzy Turing machines (Q835106) (← links)
• On the transition graphs of Turing machines. (Q1401268) (← links)
• ``Viral'' Turing machines, computation from noise and combinatorial hierarchies (Q1694134) (← links)
• A thesis for interaction (Q2055962) (← links)
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
• Computability and realizability for interactive computations (Q2343137) (← links)
• Question answering by humans and machines: a complexity-theoretic view (Q2422044) (← links)
• Verifying of interface assertions for infinite state Mealy machines (Q2453549) (← links)
• A Coinductive Animation of Turing Machines (Q2797865) (← links)
• A formal framework for interactive agents (Q2864512) (← links)
• Formalizing Turing Machines (Q2915013) (← links)
• The computational power of interactive recurrent neural networks (Q2919401) (← links)
• Reactive Turing Machines (Q3088297) (← links)
• How We Think of Computing Today (Q3507474) (← links)
• (Q4529998) (← links)
• (Q4781808) (← links)
• Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages (Q5275234) (← links)
• On relations between properties in transitive Turing machines (Q6058472) (← links)