Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "algorithm S" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 40
Tytuł:
Zastosowanie wybranych metod taksonomicznych i prospektywnych w polityce oraz strategicznym zarządzaniu publicznym
The use of selected taxonomic and foresight methods in policy making and strategic public management
Autorzy:
Baron, Marcin
Ochojski, Artur
Polko, Adam
Warzecha, Katarzyna
Powiązania:
https://bibliotekanauki.pl/articles/593014.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Ekonomiczny w Katowicach
Tematy:
Metoda delficka
Metoda k-średnich
Metoda warda
Prowadzenie polityki
Rozwój lokalny
Rozwój regionalny
Usługi publiczne
Zarządzanie strategiczne
Delphi method
K-means algorithm
Local development
Policy making
Public services
Regional development
Strategic management
Ward’s method
Opis:
W artykule prezentowane jest podejście metodyczne do prowadzenia kompleksowych analiz na potrzeby polityki i strategicznego zarządzania publicznego. Do identyfikacji podobnych regionów, pomiędzy którymi mogą wystąpić efekty uczenia się, zaproponowano metody taksonomiczne, natomiast metodę delficką wskazano jako odpowiednią dla lepszego zrozumienia przyszłości usług publicznych oraz zwiększenia zdolności adaptacyjnych na różnych poziomach sprawowania władzy. Metody zostały zilustrowane przykładami zastosowań, zaczerpniętymi z dorobku projektu ADAPT2DC („New innovative solutions to adapt governance and management of public infrastructures to demographic change”).
The paper aims at presenting method approach to complex analysis in support of policy making and strategic public management. Taxonomic methods are used to identify similar regions that can benefit of mutual learning and improve their performance in public service delivery. Delphi study is proposed to better understand public service futures and increase adaptation capacities on different levels of governance. The methods are illustrated with samples of ADAPT2DC project („New innovative solutions to adapt governance and management of public infrastructures to demographic change”) works and reflections concerning their application.
Źródło:
Studia Ekonomiczne; 2015, 233; 56-72
2083-8611
Pojawia się w:
Studia Ekonomiczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Young Adults in Subjectively Difficult Situations. A Qualitative Research of the Ways of Confronting Problems in the Work Environment
Młodzi dorośli w sytuacjach subiektywnie trudnych. Jakościowe badanie sposobów konfrontacji z problemami w środowisku pracy
Autorzy:
Rzechowska, Ewa
Krawiec, Bogumiła
Powiązania:
https://bibliotekanauki.pl/articles/34111874.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
young adults
subjectively difficult situations
professional activity
qualitative data
Quinlan’s C4.5 algorithm
młodzi dorośli
sytuacje subiektywnie trudne
aktywność zawodowa
dane jakościowe
algorytm C4.5 Quinlana
Opis:
The subject of the article is the functioning of contemporary young adults in situations subjectively difficult for them. The aim of the research was to reconstruct and analyse the ways of dealing with young adults in situations perceived by them as difficult. The research involved 122 people aged 20–35. The data was collected using a follow-up interview and a questionnaire. The studies were conducted using a research paradigm defining phenomena as a process (a processual approach), revealing its complexity of the phenomenon and internal mechanisms as well as their genesis (analysis aimed at reconstructing the diversity of its internal structure using qualitative analyses and one of the methods of data mining – Quinlan’s C4.5 algorithm). An empirical model was obtained showing the spectrum of ways of coping with difficulties encountered by young people in their everyday life: from (1) withdrawal or submission, or (2) controlling the area of activity by imposing/adopting rules, to (3) going beyond self-protection with minimising failures, or (4) perceiving confrontation with problems as a natural component of life.
Przedmiotem artykułu jest funkcjonowanie współczesnych młodych dorosłych w sytuacjach dla nich subiektywnie trudnych. Celem badań była rekonstrukcja i analiza sposobów radzenia sobie młodych dorosłych w sytuacjach postrzeganych przez nich jako trudne. W badaniach wzięły udział 122 osoby w wieku 20–35 lat. Dane zostały zebrane za pomocą wywiadu podążającego oraz ankiety. Badania przeprowadzono z wykorzystaniem paradygmatu badawczego definiującego zjawisko jako proces (podejście procesualne), ujawniającego jego złożoność i wewnętrzne mechanizmy oraz ich genezę (analiza ukierunkowana na rekonstrukcję różnorodności jego wewnętrznej struktury z wykorzystaniem analiz jakościowych oraz jednej z metod data mining – algorytmu C4.5 Quinlana). Uzyskano model empiryczny ukazujący spektrum sposobów radzenia sobie z trudnościami napotykanymi przez młodych ludzi w codziennym życiu: od (1) wycofania lub podporządkowania się bądź (2) kontrolowania obszaru działania poprzez narzucanie/przyjmowanie reguł do (3) wykroczenia poza ochronę siebie poprzez minimalizowanie niepowodzeń czy (4) postrzegania konfrontacji z problemami jako naturalnego składnika życia.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska, sectio J – Paedagogia-Psychologia; 2023, 36, 4; 95-114
0867-2040
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska, sectio J – Paedagogia-Psychologia
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards use of dijkstra algorithm for optimal navigation of an unmanned surface vehicle in a real-time marine environment with results from artificial potential field
Autorzy:
Singh, Y.
Sharma, S.
Sutton, R.
Hatton, D.
Powiązania:
https://bibliotekanauki.pl/articles/116058.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
autonomous vehicles
dijkstra’s algorithm
Unmanned Surface Vehicle (USV)
port of portsmouth
Artificial Path Planning (APF)
Artificial Potential Field
real-time marine environment
optimal navigation
Opis:
The growing need of ocean surveying and exploration for scientific and industrial application has led to the requirement of routing strategies for ocean vehicles which are optimal in nature. Most of the op-timal path planning for marine vehicles had been conducted offline in a self-made environment. This paper takes into account a practical marine environment, i.e. Portsmouth Harbour, for finding an optimal path in terms of computational time between source and end points on a real time map for an USV. The current study makes use of a grid map generated from original and uses a Dijkstra algorithm to find the shortest path for a single USV. In order to benchmark the study, a path planning study using a well-known local path planning method artificial path planning (APF) has been conducted in a real time marine environment and effectiveness is measured in terms of path length and computational time.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2018, 12, 1; 125-131
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The parallel tiled WZ factorization algorithm for multicore architectures
Autorzy:
Bylina, Beata
Bylina, Jarosław
Powiązania:
https://bibliotekanauki.pl/articles/331092.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
tiled algorithm
WZ factorization
solution of linear system
Amdahl’s law
high performance computing
multicore architecture
rozkład WZ
układ liniowy
prawo Amdahla
architektura wielordzeniowa
Opis:
The aim of this paper is to investigate dense linear algebra algorithms on shared memory multicore architectures. The design and implementation of a parallel tiled WZ factorization algorithm which can fully exploit such architectures are presented. Three parallel implementations of the algorithm are studied. The first one relies only on exploiting multithreaded BLAS (basic linear algebra subprograms) operations. The second implementation, except for BLAS operations, employs the OpenMP standard to use the loop-level parallelism. The third implementation, except for BLAS operations, employs the OpenMP task directive with the depend clause. We report the computational performance and the speedup of the parallel tiled WZ factorization algorithm on shared memory multicore architectures for dense square diagonally dominant matrices. Then we compare our parallel implementations with the respective LU factorization from a vendor implemented LAPACK library. We also analyze the numerical accuracy. Two of our implementations can be achieved with near maximal theoretical speedup implied by Amdahl’s law.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 2; 407-419
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The 2 ½D algorithm in robot workspace analysis
Autorzy:
Kost, G.
Reclik, D.
Powiązania:
https://bibliotekanauki.pl/articles/386291.pdf
Data publikacji:
2008
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
algorytm 2 1/2 D
robotyka
algorytm Floyd'a
2 1/2 D algorithm
robotics
Floyd’s algorithm
Opis:
In this paper there is presented the method of 3D manipulator’s workspace analysis. The analysis of robot’s work-space is necessary for generation the safety movement path. There was 2 ˝ D method, which is based on algorithm of following sections defining in robot work area. Those sections are explored by flat analysis, but the results are transposed into graph form. This graph is the record of all possible movements, so to get the optimum movement there must be used Floyd’s algorithm. This, shortest trace is optimized and smoothed by using B-Spline curves.
Źródło:
Acta Mechanica et Automatica; 2008, 2, 3; 65-70
1898-4088
2300-5319
Pojawia się w:
Acta Mechanica et Automatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Robust Algorithm S to assess the precision of interlaboratory measurements
Autorzy:
Volodarsky, E. T.
Warsza, Z. L.
Kosheva, L.
Idźkowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/114514.pdf
Data publikacji:
2015
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
robust statistics
algorithm S
test laboratory
comparability and acceptability of interlaboratory results
uncertainty
Opis:
The application of robust statistical methods to assess the precision (uncertainty) of the results of interlaboratory comparison tests is presented. The case, when these results may include outliers is considered. An usual rejection of such data reduces the reliability of evaluation, especially for small samples. The robust methods take into consideration all samples data including outliers. The use of the robust method Algorithm S is provided for estimating the precision of some measuring method tested in comparative studies in the group of accredited laboratories. Result obtained for simulated example is very close to the case with rejection outliers, but more reliable.
Źródło:
Measurement Automation Monitoring; 2015, 61, 4; 111-114
2450-2855
Pojawia się w:
Measurement Automation Monitoring
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quantum Factorization of Integers 21 and 91 using Shor’s Algorithm
Autorzy:
Ardhyamath, Poornima
Naghabhushana, N. M.
Ujjinimatad, Rohitha
Powiązania:
https://bibliotekanauki.pl/articles/1070857.pdf
Data publikacji:
2019
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Euclidean Algorithm
Factorization
GCD
Quantum Fourier Transform
Shor’s Algorithm
Opis:
In this paper we focused on the factorization of integer in detail using well known Shor’s algorithm and its quantum part realization. The algorithm finds prime factors any integer more efficiently than any known classical algorithm. It is based on prior knowledge of the answer to the factorization problem. Algorithm includes finding gcd using polynomial time Euclidean algorithm, determination of unknown period from quantum computer and continued fraction expansion approach. Factorization of two integers 21 and 91 are shown in this paper with all steps. Quantum part of the factorization described mathematically.
Źródło:
World Scientific News; 2019, 123; 102-113
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Profesor Tadeusz Łobos i jego algorytm A4
Professor Tadeusz Llobos and his A4 algorithm
Autorzy:
Chrzan, K. L.
Powiązania:
https://bibliotekanauki.pl/articles/1203359.pdf
Data publikacji:
2018
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Napędów i Maszyn Elektrycznych Komel
Tematy:
cyfrowa ochrona linii
algorytmy identyfikacji zwarć
algorytm Łobosa
algorytm A4
digital line protection
algorithms for distance protection
Lobos’s algorithm A4
Opis:
This document shows cirriculum vitae, scientific work and achievement of Prof. Tadeusz Łobos. The most known his achievement is algorithm A3 and especially algorithm A4. This second one was many times referred and explained in reading books. What is visible in his carrier it is a very intensive co-operation with German scientists. During 48 years scientific activity he spent over 10 years in Germany in the frame of 13 different scholarships and on the 4 years long contract in Darmstadt, Erlangen, Saarbruecken and Dresden. As alone from polish electrical engineers he became the prestigious Humboldt Research Award. Tadeusz Łobos published over 300 articles and conference papers, got 7 patents and was the supervisor of 13 doctor theses.
W pracy opisano życiorys, pracę naukową i osiągnięcia prof. Tadeusza Łobosa. Najbardziej znanym jego osiągnięciem są algorytmy Łobosa A3, a szczególnie algorytm A4 wielokrotnie cytowany i opisany w książkach. Zwraca uwagę niezwykle intensywna współpraca z partnerami niemieckimi. W ciągu swej 48 letniej pracy naukowej, przebywał w sumie ponad 10 lat na co najmniej 13 stypendiach oraz 4-letnim kontrakcie w Darmstadzie, Erlangen, Saarbruecken i Dreźnie. Jako jedyny polski elektrotechnik otrzymał prestiżową Humboldt Research Award, opublikował ponad 300 artykułów i referatów konferencyjnych, otrzymał 7 patentów i był promotorem 13 prac doktorskich.
Źródło:
Maszyny Elektryczne: zeszyty problemowe; 2018, 4, 120; 143-147
0239-3646
2084-5618
Pojawia się w:
Maszyny Elektryczne: zeszyty problemowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Peculiarities of an inspection of a scene of an accident during investigations of crashes and accidents at railway transport according to the legislation of Ukraine
Autorzy:
Basysta, Irina
Powiązania:
https://bibliotekanauki.pl/articles/1861718.pdf
Data publikacji:
2014
Wydawca:
Wyższa Szkoła Bezpieczeństwa Publicznego i Indywidualnego Apeiron w Krakowie
Tematy:
investigation of criminal offences
investigator
algorithm of one’s work
version
investigation
accident
crash
railway transport
Opis:
During investigations of criminal offences of this category it is extremely important for an investigator to have proper access to the scene of an accident and to develop their own algorithm of work. According to the results of our study of the statistical data and materials of criminal proceedings (cases), we have found out that a lot of criminal cases in Ukraine were closed for various reasons for the past three years. In particular, there were registered 88 cases according to the constituent elements of offence, provided for in Art. 276 of the Criminal Code of Ukraine in 2011. There were 5 cases closed by procedure, and 67 ones taken to courts. In 2012, there were registered 53 cases according to the constituent elements of offence, provided for in Art. 276 of the Criminal Code of Ukraine. 13 of them were closed by procedure, and 71 cases were taken to court. And in 2013, the rate got worse since out of 237 registered cases according to the constituent elements of offence, there were 1429 closed by procedure and 11 ones taken to courts. Taking into consideration these data, it is timely and necessary to update scholarly attention to the key aspects of the issues, to develop the mechanism of improving current legislation and the algorithms for the proper functioning of investigators.
Źródło:
Security Dimensions; 2014, 12(12); 109-116
2353-7000
Pojawia się w:
Security Dimensions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Order optimization of health resorts treatment using Palmers algorithm as one of the key activities describing the business model
Autorzy:
Szromek, A. R.
Powiązania:
https://bibliotekanauki.pl/articles/323803.pdf
Data publikacji:
2018
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
optimisation
Palmer’s algorithm
health resorts
business model
optymalizacja
algorytm Palmera
uzdrowisko
model biznesowy
Opis:
The aim of the article is to present one of the optimization methods of logistics processes, as solutions to improve operational efficiency in business models of spa enterprises. The author uses the Palmer's algorithm, using it to optimize the schedule of performing treatments in health resorts. The final result of the publication is the proposal to use the Palmer's algorithm with the author's amendment. The solution was supported by an example of using its for health resort treatments.
Źródło:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska; 2018, 119; 301-311
1641-3466
Pojawia się w:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization model of freight transportation on the routes of international transport corridors
Autorzy:
Prokudin, Georgiy
Oliskevych, Myroslav
Сhupaylenko, Olexiy
Maidanik, Kateryna
Powiązania:
https://bibliotekanauki.pl/articles/2141062.pdf
Data publikacji:
2020
Wydawca:
Fundacja Centrum Badań Socjologicznych
Tematy:
Dijkstra’s algorithm
shortest routes
freight transportation
road network
computer system
Opis:
The article deals with the modified Dijkstra’s algorithm of searching the shortest routes between all transport nodes of the road-transport network, which allows presenting the transport problem in the classical matrix form. This makes it possible to apply each of the known methods of optimal transport plans to solve it. The object of study is the transport process of freight transportation on the transport network by routes of international transport corridors. The purpose of the work is to improve the methods of solving the problems of finding the shortest routes on the transport network, including sections of international transport corridors. The research method is the analysis and modeling of freight transportation on road networks. The modified Dijkstra’s algorithm of finding the shortest paths between all nodes of the road-transport network was work out, which allows to represent the transport problem in the classical matrix form, i.e. in the form of a table of connections. This makes it possible to apply each of the known methods of constructing optimal plans of cargo transportation in the table of connections. The software complex based on the developed algorithm was designed in the algorithmic language Delphi, which was tested on the example of a transport problem set in the form of a road network, as well as complex testing and debugging of a computer system to support decision-making on the optimization of freight traffic on Ukrainian and Western Europe transport systems.
Źródło:
Journal of Sustainable Development of Transport and Logistics; 2020, 5, 1; 66-76
2520-2979
Pojawia się w:
Journal of Sustainable Development of Transport and Logistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Fuel Saving Operation for Coastal Merchant Ships using Weather Routing
Autorzy:
Takashima, K.
Mezaoui, B.
Shoji, R.
Powiązania:
https://bibliotekanauki.pl/articles/116404.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Weather Routing
route planning
Weather Navigation
Coastal Merchant Ship
Fuel Saving Operation
Dijkstra’s Algorithm
Simulation Study
Fuel Consumption
Opis:
It is well known that Weather Routing is one of the effective ship operation methods to reduce fuel consumption and many studies have been conducted to develop the effective calculation methods. However, most studies were performed focusing on the ocean going ships, and there were few studies made for coastal ships. The authors propose a minimum fuel route calculation method for coastal ships that use the precise forecasted environmental data and the propulsion performance data of the ship on actual seas. In the proposed method, we use the Dijkstra’s algorithm to calculate an optimum minimum fuel route suitable for coastal ships. Simulation study was carried out to evaluate the effectiveness of the proposed method using two coastal ships. As the result of study, the authors confirmed that the proposed calculation method is effective for fuel consumption reduction and is applicable for the operation of coastal merchant ships.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2009, 3, 4; 401-406
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Faddeev-Sominsky’s algorithm
Autorzy:
Torres-Silva, H.
López-Bonilla, J.
Vidal-Beltrán, S.
Powiązania:
https://bibliotekanauki.pl/articles/1166341.pdf
Data publikacji:
2018
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Adjoint matrix
Characteristic equation
Eigenvalue problem
Faddeev-Sominsky’s method
Inverse matrix
Leverrier-Takeno’s algorithm
Resolvent of a matrix
Opis:
We comment that the Faddeev-Sominsky’s process to obtain an inverse matrix is equivalent to the Cayley-Hamilton-Frobenius theorem plus the Leverrier-Takeno’s method to construct the characteristic polynomial of an arbitrary matrix. Besides, we deduce the Lanczos expression for the resolvent of the corresponding matrix.
Źródło:
World Scientific News; 2018, 106; 238-244
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the block decomposition and spectral factors of λ-matrices
Autorzy:
Bekhiti, Belkacem
Nail, Bachir
Dahimene, Abdelhakim
Hariche, Kamel
Fragulis, George F.
Powiązania:
https://bibliotekanauki.pl/articles/2049949.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
block roots
solvents
spectral factors
block-Q.D. algorithm
block-Horner’s algorithm
matrix polynomials
Opis:
In this paper we have factorized matrix polynomials into a complete set of spectral factors using a new design algorithm, and with some systematic procedures a complete set of block roots (solvents) have been obtained. The newly developed procedure is just an extension of the (scalar) Horner method to its block form for use in the computation of the block roots of matrix polynomial, the block-Horner method bringing a local iterative nature, faster convergence, nested programmable scheme, needless of any prior knowledge of the matrix polynomial, with the only one inconvenience, which is the strong dependence on the initial guess. In order to avoid this trap, we proposed a combination of two computational procedures, for which the complete program starts with the right block-Q.D. algorithm. It is then followed by a refinement of the right factor by block-Horner’s algorithm. This results in the global nature of the program, which is faster in execution, has well defined initial conditions, and good convergence in much less time.
Źródło:
Control and Cybernetics; 2020, 49, 1; 41-76
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł
Wyświetlanie 1-15 z 40

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies