scientific article; zbMATH DE number 3349780
From MaRDI portal
Publication:5625129
Cited in
(34)- Some relationships between logics of programs and complexity theory
- White pebbles help
- A simplified proof of \(DDL<DL\)
- Floyd's principle, correctness theories and program equivalence
- Definability by programs in first-order structures
- On the expressive power of finitely typed and universally polymorphic recursive procedures
- A formal system of partial recursive functions
- Computability by means of effectively definable schemes and definability via enumerations
- Reflective relational machines
- On approximate and algebraic computability over the real numbers
- Computation by `While' programs on topological partial algebras
- Limiting semantics of numerical programs
- Program schemes, arrays, Lindström quantifiers and zero-one laws
- Counter machines
- Translatability of schemas over restricted interpretations
- Recursive tables and effective definition schemes
- Computability by nondeterministic program and the Moschovakis search computability
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- Directed evaluation
- Minimality considerations for ordinal computers modeling constructibility
- Enumeration reducibility and computable structure theory
- Program Schemes with Deep Pushdown Storage
- Computing on structures
- Theses for computation and recursion on concrete and abstract structures
- Generalizing Computability Theory to Abstract Algebras
- A Survey on Analog Models of Computation
- Feferman on computability
- scientific article; zbMATH DE number 7809184 (Why is no real title available?)
- Complexity of optimizing over the integers
- Ivan Soskov: a life in computability
- Computing with infinitary logic
- Halin's infinite ray theorems: complexity and reverse mathematics
- Necessary and sufficient conditions for the universality of programming formalisms
- Non-recursiveness of the operations on real numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5625129)
