Temat: Lucas number - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On generalized Pell numbers and their graph representations
Autorzy:: Włoch, Iwona
Powiązania:: https://bibliotekanauki.pl/articles/745807.pdf
Data publikacji:: 2008
Wydawca:: Polskie Towarzystwo Matematyczne
Tematy:: Pell number
Pell-Lucas number
k-independent set of graph
Opis:: In this paper we give a generalization of the Pell numbers and the Pell-Lucas numbers and next we apply this concept for their graph representations. We shall show that the generalized Pell numbers and the Pell-Lucas numbers are equal to the total number of k-independent sets in special graphs.
Źródło:: Commentationes Mathematicae; 2008, 48, 2
0373-8299
Pojawia się w:: Commentationes Mathematicae
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: On useful schema in survival analysis after heart attack
Autorzy:: Stępniak, Czesław
Powiązania:: https://bibliotekanauki.pl/articles/729744.pdf
Data publikacji:: 2014
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: lifetime after heart attack
distribution
Fibonacci number
Lucas number
Pascal triangle
Opis:: Recent model of lifetime after a heart attack involves some integer coefficients. Our goal is to get these coefficients in simple way and transparent form. To this aim we construct a schema according to a rule which combines the ideas used in the Pascal triangle and the generalized Fibonacci and Lucas numbers
Źródło:: Discussiones Mathematicae Probability and Statistics; 2014, 34, 1-2; 63-69
1509-9423
Pojawia się w:: Discussiones Mathematicae Probability and Statistics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: On the Anti-Mechanist Arguments Based on Gödel’s Theorem
Autorzy:: Krajewski, Stanisław
Powiązania:: https://bibliotekanauki.pl/articles/1796977.pdf
Data publikacji:: 2020
Wydawca:: Polskie Towarzystwo Semiotyczne
Tematy:: Gödel’s theorem
mechanism
Lucas’s argument
Penrose’s argument
computationalism
mind
consistency
algorithm
artificial intelligence
natural number
Opis:: The alleged proof of the non-mechanical, or non-computational, character of the human mind based on Gödel’s incompleteness theorem is revisited. Its history is reviewed. The proof, also known as the Lucas argument and the Penrose argument, is refuted. It is claimed, following Gödel himself and other leading logicians, that antimechanism is not implied by Gödel’s theorems alone. The present paper sets out this refutation in its strongest form, demonstrating general theorems implying the inconsistency of Lucas’s arithmetic and the semantic inadequacy of Penrose’s arithmetic. On the other hand, the limitations to our capacity for mechanizing or programming the mind are also indicated, together with two other corollaries of Gödel’s theorems: that we cannot prove that we are consistent (Gödel’s Unknowability Thesis), and that we cannot fully describe our notion of a natural number.
Źródło:: Studia Semiotyczne; 2020, 34, 1; 9-56
0137-6608
Pojawia się w:: Studia Semiotyczne
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja