Pages that link to "Item:Q5729305"
From MaRDI portal
The following pages link to Computability of Recursive Functions (Q5729305):
Displaying 50 items.
- Unconventional algorithms: complementarity of axiomatics and construction (Q406192) (← links)
- A survey of state vectors (Q458456) (← links)
- On the algorithmic complexity of static structures (Q545415) (← links)
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- On the power of several queues (Q685436) (← links)
- Instruction sequence processing operators (Q715042) (← links)
- A procedural theory of eye movements in doing arithmetic (Q790763) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- On a complexity-based way of constructivizing the recursive functions (Q922528) (← links)
- Confusion of memory (Q963414) (← links)
- Computational expressiveness of genetic systems (Q1004070) (← links)
- Existential arithmetization of Diophantine equations (Q1006616) (← links)
- On the computational power of BlenX (Q1044845) (← links)
- Some general incompleteness results for partial correctness logics (Q1110500) (← links)
- Primitive iteration and unary functions (Q1115608) (← links)
- Generation of invertible functions (Q1123625) (← links)
- A process algebraic view of Linda coordination primitives (Q1127512) (← links)
- Sequence recursiveness without cylindrification and limited register machines (Q1154263) (← links)
- On the computational power of automata with time or space bounded by Ackermann's or superexponential functions (Q1159662) (← links)
- From behaviorism to neobehaviorism (Q1222628) (← links)
- A characterization of the power of vector machines (Q1232182) (← links)
- Effective proper procedures and universal classes of program schemata (Q1236424) (← links)
- A direct method for simulating partial recursive functions by Diophantine equations (Q1326783) (← links)
- On transformations of programs (Q1393935) (← links)
- Program schemes, recursion schemes, and formal languages (Q1393937) (← links)
- Predecessor machines (Q1394128) (← links)
- Comparing three semantics for Linda-like languages (Q1575148) (← links)
- Analysis issues in Petri nets with inhibitor arcs (Q1606123) (← links)
- Counter machines (Q1606993) (← links)
- The \(\exists\forall^2\) fragment of the first-order theory of atomic set constraints is \(\Pi_1^0\)-hard (Q1607043) (← links)
- On the computational strength of pure ambient calculi (Q1763730) (← links)
- Translatability of schemas over restricted interpretations (Q1844072) (← links)
- On the expressiveness of Linda coordination primitives. (Q1854324) (← links)
- Expired data collection in shared dataspaces. (Q1874282) (← links)
- On the expressive power of movement and restriction in pure mobile ambients (Q1881256) (← links)
- The expressiveness of locally stratified programs (Q1924734) (← links)
- Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- Models of quantum computation and quantum programming languages (Q2250909) (← links)
- Maze recognizing automata and nondeterministic tape complexity (Q2264758) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- A new order-theoretic characterisation of the polytime computable functions (Q2346988) (← links)
- Bounded variability of metric temporal logic (Q2408743) (← links)
- Minimality considerations for ordinal computers modeling constructibility (Q2482462) (← links)
- Some definitional suggestions for automata theory (Q2529464) (← links)
- Towards a theory of semantics and compilers for programming languages (Q2532605) (← links)
- Über einen Automaten mit Pufferspeicherung (Q2537131) (← links)
- The lambda-gamma calculus: A language adequate for defining recursive functions (Q2542069) (← links)
- Subrecursive programming languages. II. On program size (Q2546770) (← links)
