scientific article; zbMATH DE number 3349780
From MaRDI portal
zbMath0221.02018MaRDI QIDQ5625129
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Some relationships between logics of programs and complexity theory, Computability by nondeterministic program and the Moschovakis search computability, White pebbles help, A simplified proof of \(DDL<DL\), Limiting semantics of numerical programs, Directed evaluation, Program Schemes with Deep Pushdown Storage, Complexity of optimizing over the integers, Non-recursiveness of the operations on real numbers, Enumeration Reducibility and Computable Structure Theory, Floyd's principle, correctness theories and program equivalence, Unnamed Item, Definability by programs in first-order structures, Computing on structures, Theses for Computation and Recursion on Concrete and Abstract Structures, Generalizing Computability Theory to Abstract Algebras, On the expressive power of finitely typed and universally polymorphic recursive procedures, Computing with infinitary logic, Minimality considerations for ordinal computers modeling constructibility, A formal system of partial recursive functions, Feferman on Computability, 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, Translatability of schemas over restricted interpretations, Necessary and sufficient conditions for the universality of programming formalisms, Recursive tables and effective definition schemes, A Survey on Analog Models of Computation, Program schemes, arrays, Lindström quantifiers and zero-one laws, Counter machines, Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
