The following pages link to (Q5625129):
Displaying 31 items.
- Computing with infinitary logic (Q672337) (← links)
- Necessary and sufficient conditions for the universality of programming formalisms (Q801666) (← links)
- Non-recursiveness of the operations on real numbers (Q909437) (← links)
- Some relationships between logics of programs and complexity theory (Q1106839) (← links)
- White pebbles help (Q1111025) (← links)
- A simplified proof of \(DDL<DL\) (Q1117214) (← links)
- Floyd's principle, correctness theories and program equivalence (Q1158948) (← links)
- Definability by programs in first-order structures (Q1171876) (← links)
- On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)
- A formal system of partial recursive functions (Q1218847) (← links)
- Computability by means of effectively definable schemes and definability via enumerations (Q1263579) (← links)
- Reflective relational machines (Q1271557) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- Limiting semantics of numerical programs (Q1392276) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- Counter machines (Q1606993) (← links)
- Translatability of schemas over restricted interpretations (Q1844072) (← links)
- Recursive tables and effective definition schemes (Q1858431) (← links)
- Computability by nondeterministic program and the Moschovakis search computability (Q1905256) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- Directed evaluation (Q2192677) (← links)
- Minimality considerations for ordinal computers modeling constructibility (Q2482462) (← links)
- Enumeration Reducibility and Computable Structure Theory (Q2970965) (← links)
- Program Schemes with Deep Pushdown Storage (Q3507414) (← links)
- Computing on structures (Q4630296) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Generalizing Computability Theory to Abstract Algebras (Q4637219) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Feferman on Computability (Q5214780) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)