-
1مؤتمر
المصدر: urn:isbn:978-3-03-133179-4
Combinatorics on Words - 14th International Conference, WORDS 2023, Proceedings, 206—219 (2023); 14th International Conference on WORDS 2023, Umeå, Swe [Swe], 12-06-2023 => 16-06-2023مصطلحات موضوعية: Automatic sequences, Constant-recursive sequences, Magic numbers, Periodic sequences, Regular sequences, Constant-recursive sequence, Deterministic finite automata, Formal languages and automata, Integer-N, Nondeterministic finite automaton, Periodic sequence, Recursive sequences, Regular sequence, Theoretical Computer Science, Computer Science (all), Physical, chemical, mathematical & earth Sciences, Mathematics, Physique, chimie, mathématiques & sciences de la terre, Mathématiques
الوصول الحر: https://orbi.uliege.be/handle/2268/300422Test
-
2دورية أكاديمية
المؤلفون: A Manjusree, Panuganti Srinivasa Sai
المصدر: World Journal of Advanced Research and Reviews 17(1) 119-125
مصطلحات موضوعية: Partition, r-partition, Smallest parts of the partition, r-partition of positive integer n
العلاقة: https://zenodo.org/communities/wjarrTest; https://zenodo.org/record/8053768Test; https://doi.org/10.5281/zenodo.8053768Test; oai:zenodo.org:8053768
الإتاحة: https://doi.org/10.5281/zenodo.8053768Test
https://doi.org/10.30574/wjarr.2023.17.1.1390Test
https://doi.org/10.5281/zenodo.8053767Test
https://zenodo.org/record/8053768Test -
3مؤتمر
المؤلفون: Kozdęba, Agnieszka, Tyszka, Apoloniusz
المساهمون: Faculty of Mathematics and Computer Science of the Jagiellonian University, Hugo Kołłątaj University
مصطلحات موضوعية: algorithms whose existence is provable in ZFC, conjecturally infinite sets X \subseteq {\mathbb N}, constructively defined algorithms which are currently known, constructively defined integer n satisfies card(X)<\omega => X \subseteq (-\infty n], known elements of a set X \subseteq {\mathbb N} whose infiniteness is false or unproven, mathematical definitions and theorems with epistemic and informal notions, physical limits of computation, primes of the form n^2+1
وصف الملف: application/pdf
العلاقة: Kozdęba, Agnieszka & Tyszka, Apoloniusz, The distinction between constructively defined algorithms and algorithms whose existence is provable in ZFC inspires theorems and open problems that concern decidable sets X⊆N and cannot be formalized in mathematics understood as an a priori science as they refer to the current knowledge on X.; https://depot.ceon.pl/handle/123456789/21087Test
-
4
المؤلفون: Ekerå, Martin
المصدر: Quantum Information Processing. 20(6)
مصطلحات موضوعية: Factoring, Order finding, Shor’s algorithms, Magnetic materials, Quantum optics, Computational costs, Finding algorithm, High probability, Integer-N, Polynomial-time, Post processing, Prime factors, Single element, Polynomial approximation
وصف الملف: print
الوصول الحر: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-309987Test
https://doi.org/10.1007/s11128-021-03069-1Test -
5تقرير
المؤلفون: Kozdęba, Agnieszka, Tyszka, Apoloniusz
المساهمون: Faculty of Mathematics and Computer Science of the Jagiellonian University, Uniwersytet Jagielloński w Krakowie = Jagiellonian University (UJ), Université d'Agriculture Hugo Kollataj, Partenaires INRAE
المصدر: https://hal.archives-ouvertes.fr/hal-01614087Test ; 2022.
مصطلحات موضوعية: X is decidable by a constructively defined algorithm which is currently known, current knowledge on a set X⊆N, constructively defined integer n satisfies: (X is finite) ⇒ X⊆(-∞ comma n], physical limits of computation, primes of the form n^2+1, known elements of a set X⊆N whose infiniteness is false or unproven, conjecturally infinite sets X⊆N, mathematical definitions comma theorems and open problems with epistemic and informal notions, primes of the form n!+1, MSC: 03F55, 11A41, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]
العلاقة: hal-01614087; https://hal.archives-ouvertes.fr/hal-01614087Test; https://hal.archives-ouvertes.fr/hal-01614087v32/documentTest; https://hal.archives-ouvertes.fr/hal-01614087v32/file/kozdeba_tyszka.pdfTest
-
6تقرير
المؤلفون: Kozdęba, Agnieszka, Tyszka, Apoloniusz
المساهمون: Faculty of Mathematics and Computer Science of the Jagiellonian University, Uniwersytet Jagielloński w Krakowie = Jagiellonian University (UJ), Université d'Agriculture Hugo Kollataj, Partenaires INRAE
المصدر: https://hal.archives-ouvertes.fr/hal-01614087Test ; 2022.
مصطلحات موضوعية: X is decidable by a constructively defined algorithm which is currently known, current knowledge on a set X⊆N, constructively defined integer n satisfies: (X is finite) ⇒ X⊆(-∞ comma n], physical limits of computation, primes of the form n^2+1, known elements of a set X⊆N whose infiniteness is false or unproven, conjecturally infinite sets X⊆N, mathematical definitions comma theorems and open problems with epistemic and informal notions, MSC: 03F55, 11A41, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]
العلاقة: hal-01614087; https://hal.archives-ouvertes.fr/hal-01614087Test; https://hal.archives-ouvertes.fr/hal-01614087v28/documentTest; https://hal.archives-ouvertes.fr/hal-01614087v28/file/ak_at.pdfTest
-
7تقرير
المؤلفون: Kozdęba, Agnieszka, Tyszka, Apoloniusz
المساهمون: Faculty of Mathematics and Computer Science of the Jagiellonian University, Uniwersytet Jagielloński w Krakowie = Jagiellonian University (UJ), Université d'Agriculture Hugo Kollataj, Partenaires INRAE
المصدر: https://hal.archives-ouvertes.fr/hal-01614087Test ; 2022.
مصطلحات موضوعية: X is decidable by a constructively defined algorithm, distinction between existing algorithms and constructively defined algorithms which are currently known, current knowledge on a set X⊆N, constructively defined integer n satisfies: (X is finite) ⇒ X⊆(-∞ comma n], physical limits of computation, primes of the form n^2+1, known elements of a set X⊆N whose infiniteness is false or unproven, conjecturally infinite set X⊆N, MSC: 03F55, 11A41, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]
العلاقة: hal-01614087; https://hal.archives-ouvertes.fr/hal-01614087Test; https://hal.archives-ouvertes.fr/hal-01614087v27/documentTest; https://hal.archives-ouvertes.fr/hal-01614087v27/file/ak_at.pdfTest
-
8دورية أكاديمية
المؤلفون: Lejeune, Marie, Rigo, Michel, Rosenfeld, Matthieu
المصدر: Advances in Applied Mathematics, 112 (2020)
مصطلحات موضوعية: Binomial coefficients, Combinatorics on words, Tribonacci word, Finite words, Infinite word, Integer-N, Sturmian word, Subwords, Mathematical techniques, Physical, chemical, mathematical & earth Sciences, Mathematics, Physique, chimie, mathématiques & sciences de la terre, Mathématiques
العلاقة: urn:issn:0196-8858; urn:issn:1090-2074; https://orbi.uliege.be/handle/2268/244495Test; info:hdl:2268/244495; https://orbi.uliege.be/bitstream/2268/244495/1/version_kronecker.pdfTest; scopus-id:2-s2.0-85072973576
الإتاحة: https://doi.org/10.1016/j.aam.2019.101947Test
https://orbi.uliege.be/handle/2268/244495Test
https://orbi.uliege.be/bitstream/2268/244495/1/version_kronecker.pdfTest -
9تقرير
المؤلفون: Kozdęba, Agnieszka, Tyszka, Apoloniusz
المساهمون: Faculty of Mathematics and Computer Science of the Jagiellonian University, Uniwersytet Jagielloński w Krakowie = Jagiellonian University (UJ), Université d'Agriculture Hugo Kollataj, Partenaires INRAE
المصدر: https://hal.archives-ouvertes.fr/hal-01614087Test ; 2021.
مصطلحات موضوعية: physical limits of computation, primes of the form n^2+1, known elements of a set X⊆N whose infiniteness is false or unproven, conjecturally infinite set X⊆N, constructively defined integer n satisfies: (X is finite) ⇒ X⊆(-∞, n], current knowledge on a set X⊆N, distinction between existing algorithms and constructively defined algorithms which are currently known, X is decidable by a constructively defined algorithm, MSC: 03D20, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]
العلاقة: hal-01614087; https://hal.archives-ouvertes.fr/hal-01614087Test; https://hal.archives-ouvertes.fr/hal-01614087v25/documentTest; https://hal.archives-ouvertes.fr/hal-01614087v25/file/ak_at_december_8.pdfTest
-
10تقرير
المؤلفون: Kozdęba, Agnieszka, Tyszka, Apoloniusz
المساهمون: Faculty of Mathematics and Computer Science of the Jagiellonian University, Jagiellonian University Krakow (UJ), Université d'Agriculture Hugo Kollataj, Partenaires INRAE
المصدر: https://hal.archives-ouvertes.fr/hal-01614087Test ; 2021.
مصطلحات موضوعية: physical limits of computation, primes of the form n^2+1, known elements of a set X⊆N whose infiniteness is false or unproven, conjecturally infinite set X⊆N, constructively defined integer n satisfies: (X is finite) ⇒ X⊆(-∞, n], current knowledge on a set X⊆N, distinction between existing algorithms and constructively defined algorithms which are currently known, X is decidable by a constructively defined algorithm, MSC: 03D20, 11A41, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]
العلاقة: hal-01614087; https://hal.archives-ouvertes.fr/hal-01614087Test; https://hal.archives-ouvertes.fr/hal-01614087v23/documentTest; https://hal.archives-ouvertes.fr/hal-01614087v23/file/ak_at.pdfTest
النص الكامل