Login / Signup
Apoloniusz Tyszka
ORCID
Publication Activity (10 Years)
Years Active: 2010-2019
Publications (10 Years): 5
Top Topics
Positive Integer
Geometrical Interpretation
Efficient Solutions
Finite Number
Top Venues
FedCSIS
Open Comput. Sci.
Fundam. Informaticae
CoRR
</>
Publications
</>
Agnieszka Peszek
,
Apoloniusz Tyszka
On the Relationship Between Matiyasevich's and Smorynski's Theorems.
Sci. Ann. Comput. Sci.
29 (1) (2019)
Apoloniusz Tyszka
A hypothetical upper bound on the heights of the solutions of a Diophantine equation with a finite number of solutions.
Open Comput. Sci.
8 (1) (2018)
Krzysztof Molenda
,
Agnieszka Peszek
,
Maciej Sporysz
,
Apoloniusz Tyszka
Is there a computable upper bound on the heights of rational solutions of a Diophantine equation with a finite number of solutions?
FedCSIS
(2017)
Apoloniusz Tyszka
Is there a computable upper bound for the height of a solution of a Diophantine equation with a unique solution in positive integers?
Open Comput. Sci.
7 (1) (2017)
Apoloniusz Tyszka
A hypothetical way to compute an upper bound for the heights of solutions of a Diophantine equation with a finite number of solutions.
FedCSIS
(2015)
Apoloniusz Tyszka
MuPAD codes which implement limit-computable functions that cannot be bounded by any computable function.
FedCSIS
(2014)
Apoloniusz Tyszka
Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set?
Fundam. Informaticae
125 (1) (2013)
Apoloniusz Tyszka
A function f: N\{0}->N\{0} that cannot be bounded by a computable function and an infinite loop in MuPAD such that it takes as input a positive integer n, returns non-negative integers g(n, m) (m=1, 2, 3, ...), and f(n)=g(n, m) for any m>f(n).
CoRR
(2013)
Apoloniusz Tyszka
Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation.
Inf. Process. Lett.
113 (19-21) (2013)
Apoloniusz Tyszka
Two conjectures on the arithmetic in R and C.
Math. Log. Q.
56 (2) (2010)