Zobrazeno 1 - 10
of 1 549
pro vyhledávání: '"Computable function"'
Autor:
Primiero, Giuseppe, author
Publikováno v:
On the Foundations of Computing, 2019.
Externí odkaz:
https://doi.org/10.1093/oso/9780198835646.003.0003
Autor:
Primiero, Giuseppe, author
Publikováno v:
On the Foundations of Computing, 2019, ill.
Externí odkaz:
https://doi.org/10.1093/oso/9780198835646.003.0004
Autor:
Šimunović, Nikola
Obrađena je tema izračunljivo prebrojivih skupova. Izvedena je njihov konstrukcija preko definicije Turingovog stroja i izračunljive funkcije koristeći pritom Gödelovo numeriranje. Također, preko iste konstrukije su definirani česti matematič
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4115::bb456aed727a79e1279e8d69fa894f6d
https://urn.nsk.hr/urn:nbn:hr:166:506820
https://urn.nsk.hr/urn:nbn:hr:166:506820
Autor:
D.Kh. Zainetdinov
Publikováno v:
Учёные записки Казанского университета. Серия Физико-математические науки, Vol 158, Iss 1, Pp 51-65 (2016)
Limitwise monotonic sets, pairs of sets, and sequences consisting of infinite sets are studied in the paper. The main properties of limitwise monotonic reducibility between two sets, as well as between the set and a pair of sets defined in terms of
Externí odkaz:
https://doaj.org/article/d4422f081cad4bbea493e9b23d893b94
Autor:
Pace P. Nielsen
Publikováno v:
Computability. 11:1-8
The unary primitive recursive functions can be defined in terms of a finite set of initial functions together with a finite set of unary and binary operations that are primitive recursive in their inputs. We reduce arity considerations, by show that
Autor:
Theodore A. Slaman, Jan Reimann
Publikováno v:
Journal of the American Mathematical Society. 35:467-512
We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n n , all but countably many reals are n n -random for such a measure, where
Publikováno v:
Journal of Logic and Computation. 31:1660-1689
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by Gödel (1931, 1934) and Kleene (1936, Math. Ann., 112, 727–742). We show that this cla
Autor:
Andrew Powell
Publikováno v:
Axiomathes. 32:991-1011
This article provides a survey of key papers that characterise computable functions, but also provides some novel insights as follows. It is argued that the power of algorithms is at least as strong as functions that can be proved to be totally compu
Autor:
Ethan McCarthy
Publikováno v:
Archive for Mathematical Logic. 60:981-994
We explore the relationship between analytic behavior of a computable real valued function and the computability-theoretic complexity of the individual values of its derivative (the function’s slopes) almost-everywhere. Given a computable function