Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Dimiter Skordev"'
Autor:
Dimiter Skordev
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 1 (2019)
Given a represented space (in the sense of TTE theory), an appropriate representation is constructed for the Moschovakis extension of its carrier (with paying attention to the cases of effective topological spaces and effective metric spaces). Some r
Externí odkaz:
https://doaj.org/article/a8a33c20cf6d4d7c8eae6a1ed8a622a4
Autor:
Dimiter Skordev
Publikováno v:
Logical Methods in Computer Science, Vol Volume 12, Issue 4 (2017)
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to all of th
Externí odkaz:
https://doaj.org/article/bb8b0d24a4e14817a33c101846d57aea
Autor:
Dimiter Skordev
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 4 (2013)
A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names. Two ways to eliminate the using of such names in certain cases are indicated in
Externí odkaz:
https://doaj.org/article/6f3187915f4f4c84af57f00861a0486b
Autor:
Dimiter Skordev
Publikováno v:
Proceedings of the Bulgarian Academy of Sciences. 75:3-10
For any metric space, two binary relations are considered: the one consisting of all ordered pairs of a positive real number and a natural number such that some finite subset of the space has cardinality equal to the second number and the distance be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b630c83144b2974db82453320fc69feb
https://doi.org/10.7546/crabs.2022.01.01
https://doi.org/10.7546/crabs.2022.01.01
Autor:
Dimiter Skordev
Publikováno v:
Computability. 2:67-73
A widely used approach to computability of real functions is the one in Grzegorczyk’s style originating from [1]. This approach uses computable transformations of infinitistic names of real numbers, as well as general quantifiers over these names.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82900760c84c3146359af1b529ea4651
https://doi.org/10.3233/com-13018
https://doi.org/10.3233/com-13018
Publikováno v:
Journal of Logic and Computation. 22:899-925
The article concerns subrecursive computability of real numbers. Certain significant real numbers are shown to be M2-computable, and the set of the M2-computable real numbers is shown to be closed under the elementary functions of calculus.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abce84c47a255b30fab10fd9e90fa145
https://doi.org/10.1093/logcom/exq050
https://doi.org/10.1093/logcom/exq050
Autor:
Dimiter Skordev
Publikováno v:
Journal of Mathematical Sciences. 158:753-758
We prove that up to congruence there exist exactly fourty-four primitive bases of Boolean functions. We also apply our results in order to improve an algorithm of finding the maximal strong depth of a Boolean function. Bibliography: 4 titles.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6c4424ffb0bc02942afec64edf81b78
https://doi.org/10.1007/s10958-009-9398-y
https://doi.org/10.1007/s10958-009-9398-y
Autor:
Dimiter Skordev
Publikováno v:
MLQ. 50:520-524
A theorem published by A. Grzegorczyk in 1955 states a certain kind of effective uniform continuity of computable functionals whose values are natural numbers and whose arguments range over the total functions in the set of the natural numbers and ov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8709375ecb6a00037d1a28876fd7b46f
https://doi.org/10.1002/malq.200310117
https://doi.org/10.1002/malq.200310117
Autor:
Dimiter Skordev
Publikováno v:
MLQ. 48:91-106
Given a class ℱ oft otal functions in the set oft he natural numbers, one could study the real numbers that have arbitrarily close rational approximations explicitly expressible by means of functions from ℱ. We do this for classes ℱsatisfying c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e8717b40861751458846762ec47286a
https://doi.org/10.1002/1521-3870(200210)48:1+<91::aid-malq91>3.0.co
https://doi.org/10.1002/1521-3870(200210)48:1+<91::aid-malq91>3.0.co
Autor:
Ivan Georgiev, Dimiter Skordev
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect to this cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b4cf9a51336a022ad04f149b2126ead
