scientific article; zbMATH DE number 3305097
From MaRDI portal
Publication:5586401
zbMath0192.08702MaRDI QIDQ5586401
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Emergence via non-existence of averages, Reverse complexity, A Short Introduction to Implicit Computational Complexity, Efficient algorithms for the recognition of topologically conjugate gradient-like diffeomorhisms, Approximate counting and NP search problems, On efficiency of notations for natural numbers, V-comprehensions and P space, On space functions fully constructed by two-dimensional Turing machines, A feasible theory of truth over combinatory algebra, An algebra and a logic for \(NC^ 1\), Squeezing Feasibility, Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits, Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals, Elementary realizability, Regressive computations characterize logarithmic space, A time-space hierarchy between polynomial time and polynomial space, Game semantics approach to higher-order complexity, Unpredictability and Computational Irreducibility, A multicolour graph as a complete topological invariant for $ \Omega$-stable flows without periodic trajectories on surfaces, On parallel hierarchies and \(R_k^i\), Emergence and non-typicality of the finiteness of the attractors in many topologies, Subrecursiveness: Machine-independent notions of computability in restricted time and storage, Nondeterministic stack register machines, A method for constructing maximal subalgebras of algebras of general recursive functions, On parallel hierarchies and R ki, Computation models and function algebras, Expressing computational complexity in constructive type theory, Unnamed Item, Complexity results for MCMC derived from quantitative bounds, Read/write factorizable programs, A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations, Optimal scaling of random-walk Metropolis algorithms on general target distributions, Mining the surface: witnessing the low complexity theorems of arithmetic, Complete and tractable machine-independent characterizations of second-order polytime, Cobham recursive set functions, Complexity of algorithms and computations, On the Minimum Computation Time of Functions, Admissible closures of polynomial time computable arithmetic, A fresh look at research strategies in computational cognitive science: the case of enculturated mathematical problem solving, The provably terminating operations of the subsystem PETJ of explicit mathematics, On the computational power of automata with time or space bounded by Ackermann's or superexponential functions, Linear ordering on graphs, anti-founded sets and polynomial time computability, Machine-independent description of certain machine complexity classes, Theories with self-application and computational complexity., Bounded arithmetic for NC, ALogTIME, L and NL, Type-two polynomial-time and restricted lookahead, Abelian groups and quadratic residues in weak arithmetic, A classification of the one-argument primitive recursive functions, Feasibly constructive proofs of succinct weak circuit lower bounds, Recursive function theory and numerical analysis, Logics for reasoning about cryptographic constructions, The membership question for ETOL-languages is polynomially complete, On primitive recursive wordfunctions, Polynomial and abstract subrecursive classes, Structural recursion as a query language on lists and ordered trees, On the density of honest subrecursive classes, Resource control for synchronous cooperative threads, Unnamed Item, Polynomial time ultrapowers and the consistency of circuit lower bounds, Graph isomorphism, general remarks, Unfolding Schematic Systems, A recursion-theoretic characterisation of the positive polynomial-time functions, Classification of Morse–Smale systems and topological structure of the underlying manifolds, Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer, Axiomatizing Resource Bounds for Measure, A note on complexity measures for inductive classes in constructive type theory, The polynomial hierarchy of functions and its levels, Subrecursive programming languages. II. On program size, A note on comparison of subrecursive hierarchies, Minimization and \(\mathbf{NP}\) multifunctions, On the generative power of transformational grammars, Computing in combinatorial optimization, Feasible functionals and intersection of ramified types, Safe recursion with higher types and BCK-algebra, Implicit recursion-theoretic characterizations of counting classes, Logic and Complexity in Cognitive Science, Proof-Theoretic Semantics and Feasibility, Bounding quantum gate error rate based on reported average fidelity, A predicative and decidable characterization of the polynomial classes of languages, Some undecidability results for non-monadic Church-Rosser Thue systems, Notations for exponentiation., Complexity questions in number theory, Hereditarily-finite sets, data bases and polynomial-time computability, Unprovability of circuit upper bounds in Cook's theory PV, Relativization of the Theory of Computational Complexity, On the power of recursive word-functions without concatenation, Implicit computation complexity in higher-order programming languages, Complexity of the search for the least solution to a system of dictionary equations of exponential type
