default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDApoloniusz Tyszka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j6]Agnieszka Peszek, Apoloniusz Tyszka:
On the Relationship Between Matiyasevich's and Smorynski's Theorems. Sci. Ann. Comput. Sci. 29(1): 101-111 (2019)- 2018
- [j5]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): 109-114 (2018) - 2017
- [j4]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): 17-23 (2017) - 2013
- [j3]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): 95-99 (2013) - [j2]Apoloniusz Tyszka:
Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation. Inf. Process. Lett. 113(19-21): 719-722 (2013) - 2010
- [j1]Apoloniusz Tyszka:
Two conjectures on the arithmetic in R and C. Math. Log. Q. 56(2): 175-184 (2010)
Conference and Workshop Papers
- 2017
- [c3]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: 249-258 - 2015
- [c2]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: 709-716 - 2014
- [c1]Apoloniusz Tyszka:
MuPAD codes which implement limit-computable functions that cannot be bounded by any computable function. FedCSIS 2014: 623-629
Informal and Other Publications
- 2013
- [i1]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 abs/1310.5363 (2013)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
