On extremum-searching approximate probabilistic algorithms
Displaying 41 – 60 of 151
On reducibility of partial recursive functions.
Degtev, A.N., Sakunova, E.S. (2000)
Siberian Mathematical Journal
On resemblance and recursive isomorphism types of bounded partial recursive functions.
Litvinov, N.V. (2000)
Siberian Mathematical Journal
On resemblance and recursive isomorphism types of partial recursive functions.
Polyakov, E.A. (2001)
Siberian Mathematical Journal
On the lengths of bad sequences of monomial ideals over polynomial rings
Florian Pelupessy, Andreas Weiermann (2012)
Fundamenta Mathematicae
We give bad (with respect to the reverse inclusion ordering) sequences of monomial ideals in two variables with Ackermannian lengths and extend this to multiple recursive lengths for more variables.
On the reducibility of the index sets of families of general recursive functions.
Ю.Д. Корольков (1982)
Sibirskij matematiceskij zurnal
On the resemblance and recursive isomorphism types of partial recursive functions.
Litvinov, N.V. (2000)
Siberian Mathematical Journal
Postscript to "Built-up systems of fundamental sequences and hierarchies of number-theoretic functions".
Diana Schmidt (1977)
Archiv für mathematische Logik und Grundlagenforschung
Primitive recursive categories and machines
Yves Lafont (1989)
Diagrammes
Primitive recursive notations for infinitary formulas
Kenneth A. Bowen (1974)
Colloquium Mathematicae
Primitiv-rekursive Funktionen auf Termmengen.
Friedrich-Karl Mahn (1969)
Archiv für mathematische Logik und Grundlagenforschung
Récursivité graphique (1e partie) : catégorie des fonctions récursives primitives formelles
Albert Burroni (1986)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Refinements of inductive inference by Popperian and reliable machines
John Case, Sanjay Jain, Suzanne Ngo Manguelle (1994)
Kybernetika
Some remarks about the connections between combinatory logic and axiomatic recursion theory.
R. Hindley, G. Mitschke (1977)
Archiv für mathematische Logik und Grundlagenforschung
The algebraic uniqueness of the addition of natural numbers.
Elemer E. Rosinger (1982)
Aequationes mathematicae
The category of recursive functions
Harry Gronshor (1972)
Fundamenta Mathematicae
The complexity of uniform distribution
Martin Goldstern (1994)
Mathematica Slovaca
The limit lemma in fragments of arithmetic
Vítězslav Švejdar (2003)
Commentationes Mathematicae Universitatis Carolinae
The recursion theoretic limit lemma, saying that each function with a graph is a limit of certain function with a graph, is provable in .
The role of rudimentary relations in complexity theory
Hugo Volger (1984)
Mémoires de la Société Mathématique de France
The word problem in polycyclic groups is elementary
F. B. Cannonito, R. W. Gatterdam (1973)
Compositio Mathematica