scientific article
From MaRDI portal
Publication:3247126
zbMath0080.00902MaRDI QIDQ3247126
Publication date: 1958
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The equivalence of some general combinatorial decision problems, A complex of problems proposed by Post, Rewriting, and equational unification: the higher-order cases, [https://portal.mardi4nfdi.de/wiki/Publication:5581622 Eine Bemerkung zum Begriff der zuf�lligen Folge], Unnamed Item, [https://portal.mardi4nfdi.de/wiki/Publication:5587565 Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung], [https://portal.mardi4nfdi.de/wiki/Publication:5617399 �ber die Definition von effektiven Zufallstests], The many-one equivalence of some general combinatorial decision problems, Some Ways of Constructing a Propositional Calculus of Any Required Degree of Unsolvability, Semantics of computable physical models, State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs, The Higman operations and embeddings of recursive groups, The dependence of computability on numerical notations, On the Lattice of Recursively Enumerable Sets, The Problem of Integration in Finite Terms, A Note on Pushdown Store Automata and Regular Systems, The Undecidability of the Word Problems for Projective Geometries and Modular Lattices, How much partiality is needed for a theory of computability?, The Kleene Hierarchy Classification of Recursively Random Sequences, Unsolvable Diophantine Problems, Grushko-Like Theorems for a Class of Finitely Presented Semigroups, Probabilistic Turing Machines and Computability, Über die mit Stackautomaten berechenbaren Funktionen, A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy, Unnamed Item, On Minimal and Almost-Minimal Systems of Notations, Hierarchies in Recursive Function Theory, Notation Systems and an Effective Fixed Point Property, Word Problem for Ringoids of Numerical Functions, Conceptual Confluence in 1936: Post and Turing, On the Computational Complexity of Algorithms, Clockwork Rebooted: Is the Universe a Computer?, Church’s thesis and its relation to the concept of realizability in biology and physics, Computability by Probabilistic Turing Machines, Generalized Recursive Multivariate Interpolation, Probabilistic Recursive Functions, On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism, Recursively enumerable sets and degrees, KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS, On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines, The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian, Undecidability of the Theory of Abelian Groups with a Subgroup, The Developments of the Concept of Machine Computability from 1936 to the 1960s, On the Class of Predicates Decidable by Two-Way Multitape Finite Automata, Introduction to the Zambelli Festschrift, Über die Bestimmbarkeit des Verhaltens von Algorithmen, Relativization of the Theory of Computational Complexity, On centain decompositions of Gödel numberings, Computable Complex Analysis, La théorie des fonctions récursives et ses applications. (Exposé d'information générale), Predictability in deterministic theories, Undecidability through Fourier series, n-level rewriting systems, Counterfactual logic and the necessity of mathematics, Complexity of certain decision problems about congruential languages, The problems of cyclic equality and conjugacy for finite complete rewriting systems, Metamathematical investigations on the theory of grossone, Free Modular Lattices, Embeddings of and into Nerode semirings, The problem of space invariance for sequential machines, Castor quadruplorum, Free word problems for additive relation algebras of modules, ET and an infinitary Church's thesis, Unnamed Item, On randomness, determinism and computability, Book review of: E. G. Omodeo (ed.) and A. Policriti (ed.), Martin Davis on computability, computational logic, and mathematical foundations, Unnamed Item, The first example of a recursive function which is not primitive recursive, Derived subdivisions make every PL sphere polytopal, Controlled pushdown automata, Unnamed Item, Unnamed Item, Recursive analysis of singular ordinary differential equations, A numerical analysis of two point boundary value problem algorithms, On the computational power of automata with time or space bounded by Ackermann's or superexponential functions, An algorithmic look at financial volatility, A survey of state vectors, An arithmetical characterization of NP, Some undecidable determined games, Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines, On sets polynomially enumerable by iteration, Hypercomputation: Philosophical issues, The Possibility of Analysis: Convergence and Proofs of Convergence, On the hardness of analyzing probabilistic programs, Homotopy in two-dimensional digital images, My Life as a Logician, Martin Davis and Hilbert’s Tenth Problem, A Story of Hilbert’s Tenth Problem, Why Post Did [Not Have Turing’s Thesis], From Mathesis Universalis to Provability, Computability, and Constructivity, Some undecidable termination problems for semi-Thue systems, Myhill's work in recursion theory, On weakly confluent monadic string-rewriting systems, Computation, hypercomputation, and physical science, Some properties of finite special string-rewriting systems, Concrete digital computation: what does it take for a physical system to compute?, The pre-NTS property is undecidable for context-free grammars, Decision problems for semi-Thue systems with a few rules, Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi, Translations and structure for partial propositional calculi, A geometric hierarchy of languages, Classes of discrete optimization problems and their decision problems, Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems, Complexity classes of partial recursive functions, Remarks on the complexity of nondeterministic counter languages, Fuzzy and probabilistic programs, Nonexistence of program optimizers in several abstract settings, Simple section interchange and properties of non-computable functions, On the complexity of reasoning in Kleene algebra, Conditional Grammars, Embedding and unsolvability theorems for modular lattices, Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials, The origins of the halting problem, Unnamed Item, A formalization of multi-tape Turing machines, Towards a theory of semantics and compilers for programming languages, Stability and computability in coherent domains, Referenced automata and metaregular families, Some results concerning proofs of statements about programs, Über einen Automaten mit Pufferspeicherung, Incompleteness and the halting problem, Recursively unsolvable word problems of modular lattices and diagram- chasing, On formalised computer programs, An existence lemma for canonical forms in symbolic mathematics, Problem-solving machines for Euclidean geometry, The use of lists in the study of undecidable problems in automata theory, Unnamed Item, Translating recursion equations into flow charts, Computing degrees of unsolvability, Recursive digraphs, splinters and cylinders, The Definition of Universal Turing Machine, On the inference of Turing machines from sample computations, On the extension of Gladkij's theorem and the hierarchies of languages, Functions computable by a computer, Unnamed Item, Some Theorems on Classes of Recursively Enumerable Sets, Solvable classes of discrete dynamic programming, Communication, computability, and common interest games, Infinite regular Thue systems, Forecasting errors and bounded rationality: An example, A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets, Finite complete rewriting systems and the complexity of word problem, Note on Degrees of Partial Functions, Classes of Predictably Computable Functions, Unnamed Item, Admissible representations of effective cpo's, Unnamed Item, Links between physics and set theory., Pseudo-natural algorithms for the word problem for finitely presented monoids and groups, Abstract abstract reduction
