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ę "computational theory" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 18
Tytuł:
Czy działania opierają się na reprezentacjach? Kognitywistyka a praktyka
Are Actions Founded on Representations? Cognitive Science and Practice
Autorzy:
Płotka, Witold
Powiązania:
https://bibliotekanauki.pl/articles/637941.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
computational theory of thinking
Fodor’s Representational Theory of Mind
neural networks
Opis:
The article, by referring to the computational theory of thinking and Fodor’s Representational Theory of Mind, argues that both theories presuppose an understanding of activity as a process reducible to a set of rules. The author rejects the presupposition and sketches an alternative view on action; the alternative view justifies a necessity of building connectionist models of neural networks and it leads to a formulation of hypothesis of extended, embodied and embedded mind.
Źródło:
Rocznik Kognitywistyczny; 2011, 5; 159-165
1689-927X
Pojawia się w:
Rocznik Kognitywistyczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
AI Can Never Think: The Uniqueness of Human Thought
Autorzy:
Nehez, Jason
Powiązania:
https://bibliotekanauki.pl/articles/507400.pdf
Data publikacji:
2020-09-30
Wydawca:
International Étienne Gilson Society
Tematy:
AI
artificial intelligence
thought
mind
turing
materialism
functionalism
dualism
semiotics
computational theory
Opis:
As the saying goes, imitation is the most sincere form of flattery, yet very few assume imitation to be equivalence. An original masterpiece may be worth millions while a copy, no matter how exact the resemblance, would yield just a fraction of the price. I propose that there is more to thought than a machine will ever be capable of. The imitation game, while reproducing an imitation that is something like human thinking and interaction, will never achieve that same unique mode of thinking we experience as human species. This presentation aims to outline some of the hidden assumptions in the Turing Test for the computational theory of mind, explain some of the most popular arguments against the computational model of thought today, provide some original thought experiments, and finally discuss briefly the unique aspects of human thought that may never be able to be replicated in a machine.
Źródło:
Studia Gilsoniana; 2020, 9, 3; 467-492
2300-0066
Pojawia się w:
Studia Gilsoniana
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Extension of Critical Programs of the Computational Theory of Mind
Autorzy:
Baryshnikov, Pavel N.
Powiązania:
https://bibliotekanauki.pl/articles/31234160.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Instytut Filozofii i Socjologii PAN
Tematy:
anticomputationalism
computational theory of mind
Chinese room
finite automata
symbolic semantics
language of thought
Opis:
Technological advances in computer science have secured the computer metaphor status of a heuristic methodological tool used to answer the question about the nature of mind. Nevertheless, some philosophers strongly support opposite opinions. Anti-computationalism in the philosophy of mind is a methodological program that uses extremely heterogeneous grounds for argumentation, deserving analysis and discussion. This article provides an overview and interpretation of the traditional criticism of the computational theory of mind (computationalism); its basic theses have been formed in Western philosophy in the last quarter of the 20th century. The main goal is to reveal the content of the arguments of typical anti-computationalist programs and expand their application to the framework of the semantic problems of the Classic Computational Theory of Mind. The main fault of the symbolic approach in the classical computationalism is the absence of a full-fledged theory of semantic properties. The relevance of considering these seemingly outdated problems is justified by the fact that the problem of meaning (and general problems of semantics) remains in the core of the latest developments in various areas of AI and the principles of human-computer interaction.
Źródło:
Filozofia i Nauka; 2022, 10, zeszyt specjalny; 263-274
2300-4711
2545-1936
Pojawia się w:
Filozofia i Nauka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Objections to Computationalism: A Survey
Autorzy:
MIŁKOWSKI, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/488675.pdf
Data publikacji:
2018-09
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II. Towarzystwo Naukowe KUL
Tematy:
computationalism
computational theory of mind
representation
computation
modeling
komputacjonizm
komputacjonalna teoria umysłu
reprezentacja
komputacja
modelowanie
Opis:
ZARZUTY WOBEC KOMPUTACJONIZMU — PRZEGLĄD
Źródło:
Roczniki Filozoficzne; 2018, 66, 3; 35-75
0035-7685
Pojawia się w:
Roczniki Filozoficzne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Czy istnieją czynności umysłu, których nie można reprezentować za pomocą maszyn Turinga?
Are there activities of the mind that cannot be represented by Turing machines?
Autorzy:
Fornal, Marzena
Powiązania:
https://bibliotekanauki.pl/articles/38425363.pdf
Data publikacji:
2023-09-11
Wydawca:
Akademia Humanistyczno-Ekonomiczna w Łodzi
Tematy:
komputacjonizm
obliczeniowa teoria umysłu
argument gödlowski
Roger Penrose
maszyna Turinga
Kurt Gödel
John Randolph Lucas
computationalism
computational theory of mind
Gödelian argument
Turing machine
Opis:
Artykuł stanowi próbę odpowiedzi na pytanie, czy jesteśmy w stanie wskazać takie czynności umysłu, które nie są możliwe do reprezentacji za pomocą maszyny Turinga? Jest to zatem pytanie o to, czy wszystkie nasze stany mentalne posiadają obliczeniową naturę. Problem ten będzie rozważany w odniesieniu do tak zwanego argumentu gödlowskiego, opierającego się na dwóch twierdzeniach Gödla: 1) o niezupełności oraz 2) o niedowodliwości niesprzeczności, skierowanego przeciwko obliczeniowym teoriom umysłu. Argument ten w wersji zaprezentowanej przez Johna Randolpha Lucasa zostanie poddany krytycznej analizie, która doprowadzi do pozytywnych wniosków zawartych w końcowej części artykułu.
The article is an attempt to answer the question whether we are able to identify such activities of the mind that are not possible to be represented by a Turing machine? Thus, it is a question of whether all our mental states have a computational nature. This problem will be considered in relation to the so-called Gödel argument, based on two Gödel theorems: 1. on incompleteness and 2. on the incompleteness of non-contradiction, directed against computational theories of mind. This argument, as presented by John Randolph Lucas, will be critically analyzed, which will lead to positive conclusions in the final part of the article.
Źródło:
Kultura i Wychowanie; 2023, 23, 1; 107-115
2544-9427
2083-2923
Pojawia się w:
Kultura i Wychowanie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Proof Compression and NP Versus PSPACE II: Addendum
Autorzy:
Gordeev, Lew
Haeusler, Edward Hermann
Powiązania:
https://bibliotekanauki.pl/articles/2142754.pdf
Data publikacji:
2022-01-07
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
graph theory
natural deduction
computational complexity
Opis:
In our previous work we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier’s cut-free sequent calculus for minimal logic (HSC) with the horizontal compressing in the corresponding minimal Prawitz-style natural deduction (ND). In this Addendum we show how to prove a weaker result NP = coNP without referring to HSC. The underlying idea (due to the second author) is to omit full minimal logic and compress only “naive” normal tree-like ND refutations of the existence of Hamiltonian cycles in given non-Hamiltonian graphs, since the Hamiltonian graph problem in NPcomplete. Thus, loosely speaking, the proof of NP = coNP can be obtained by HSC-elimination from our proof of NP = PSPACE.
Źródło:
Bulletin of the Section of Logic; 2022, 51, 2; 197-205
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Interfacing language, spatial perception and cognition in Type Theory with Records
Autorzy:
Dobnik, S.
Cooper, R.
Powiązania:
https://bibliotekanauki.pl/articles/103889.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
spatial language
TTR
Type Theory with Records
computational framework
Opis:
We argue that computational modelling of perception, action, language, and cognition introduces several requirements of a formal semantic theory and its practical implementations in situated dialogue agents. Using examples of semantic representations of spatial descriptions we show how Type Theory with Records (TTR) satisfies these requirements and provides a promising knowledge representation system for situated agents.
Źródło:
Journal of Language Modelling; 2017, 5, 2; 273-301
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Computational intelligence in marine control engineering education
Autorzy:
Lisowski, Józef
Powiązania:
https://bibliotekanauki.pl/articles/1551899.pdf
Data publikacji:
2021
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
ship control
marine engineering curriculum
computational intelligence
game theory
computer simulation
Opis:
This paper presents a new approach to the existing training of marine control engineering professionals using artificial intelligence. We use optimisation strategies, neural networks and game theory to support optimal, safe ship control by applying the latest scientific achievements to the current process of educating students as future marine officers. Recent advancements in shipbuilding, equipment for robotised ships, the high quality of shipboard game plans, the cost of overhauling, dependability, the fixing of the shipboard equipment and the requesting of the safe shipping and environmental protection, requires constant information on recent equipment and programming for computational intelligence by marine officers. We carry out an analysis to determine which methods of artificial intelligence can allow us to eliminate human subjectivity and uncertainty from real navigational situations involving manoeuvring decisions made by marine officers. Trainees learn by using computer simulation methods to calculate the optimal safe traverse of the ship in the event of a possible collision with other ships, which are mapped using neural networks that take into consideration the subjectivity of the navigator. The game-optimal safe trajectory for the ship also considers the uncertainty in the navigational situation, which is measured in terms of the risk of collision. The use of artificial intelligence methods in the final stage of training on ship automation can improve the practical education of marine officers and allow for safer and more effective ship operation.
Źródło:
Polish Maritime Research; 2021, 1; 163-172
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modeling computational studies of modified drug molecules binding to the LRRK2 protein in the treatment of Parkinson’s disease
Autorzy:
Shah, H.
Darsey, J. A.
Powiązania:
https://bibliotekanauki.pl/articles/284742.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Polskie Towarzystwo Biominerałów
Tematy:
LRRK2 proteins
Parkinson
Computational Modeling
IC50
Density Functional Theory
DFT
Opis:
Parkinson’s disease is a neurodegenerative and progressive disease of the central nervous system. It affects more than 10 million patients worldwide and the symptoms allow for little to no control for movement. These symptoms appear because the chemical messenger dopamine is being made in small quantities from impaired cells. However, the disease often forms when there is a mutation in the LRRK2 gene, as the functions of the protein become abnormal. The IC50 value is essential information about molecules because it measures their effectiveness. The goal of this research was to design molecules with a lower IC50 value. This was first done by modeling molecules on the molecular modeling program, Gaussian 09. Modifications were made to molecules that were said to bind to the LRRK2 protein. Modifications ranged from adding a single atom or replacing atoms with groups. After running these molecules on the program, the total energy was found. Using the equation found from the correlation between 1/IC50 and the total energy, the IC50 value was predicted for each of the modified molecules. Many of the modified molecules portrayed a positive percent difference between the original IC50 value and the new one. This saves both time and money because the molecules with lower IC50 values can be made, preserving the resources. After creating the molecule with a low IC50 value, further experimental procedures can be taken; this is a large step in assisting researchers to reach a potential treatment because it is more efficient.
Źródło:
Engineering of Biomaterials; 2018, 21, 145; 2-7
1429-7248
Pojawia się w:
Engineering of Biomaterials
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of the efficiency of graph coloring algorithms
Autorzy:
Kubale, Marek
Powiązania:
https://bibliotekanauki.pl/articles/748571.pdf
Data publikacji:
1982
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Computational complexity and efficiency of algorithms
Coloring of graphs and hypergraphs
Graph theory
Opis:
.
This paper discusses the computational efficiency and the number of colors used by the following algorithms for coloring vertices of graphs: sequential coloring and sequential coloring with interchange algorithms for a largest-first and a smallest-last orderings of vertices, the coloring-pairs algorithm, and the approximately maximum independent set algorithm. Each algorithm is supplied with a Pascal-like program, time complexity in terms of the size of a graph, and worst-case behaviour. In conclusion, some computational results are included with support the estimations and suggest the sequential coloring with interchange algorithm for a largest-first vertex ordering as a method which uses the least number of colors for uniformly distributed random graphs.
Źródło:
Mathematica Applicanda; 1982, 10, 19
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Aeroacoustic analysis based on FW–H analogy to predict low-frequency in-plane harmonic noise of a helicopter rotor in hover
Autorzy:
Suresh, T.
Szulc, O.
Flaszynski, P.
Powiązania:
https://bibliotekanauki.pl/articles/38695686.pdf
Data publikacji:
2022
Wydawca:
Instytut Podstawowych Problemów Techniki PAN
Tematy:
Lighthill’s analogy
Farassat’s formulation
blade element momentum theory
computational aeroacoustics
computational fluid dynamics
thickness noise
monopole
loading noise
dipole
Opis:
The integral formulation of the Ffowcs-Williams and Hawkings (FW–H) analogy, developed by Farassat (known as Farassat’s formulation 1A), is implemented to study the sound generation and propagation of rotating slender bodies. The general post-processing numerical code utilizes the linear acoustic theory to predict the thickness and loading noise terms for bodies in subsonic motion. The developed numerical code is validated for elementary acoustic sources (rotating monopole and dipole) against analytical solutions. The validated code is then applied for prediction of lowfrequency in-plane harmonic noise (LF-IPH) of a model helicopter rotor of Sargent and Schmitz in a low-thrust hover with full-scale tip Mach number. The required loading distribution of the rotor blade is obtained with CFD (RANS) and Blade Element Momentum Theory (BEMT) methods and also validated against literature data. The developed acoustic code, supplemented by CFD and BEMT loading analyses, allows for a detailed comparison (thickness and loading, near- and far-field, etc.) of the LFIPH noise of a helicopter rotor in both, time and frequency domains. The predicted (FW–H) acoustic signals are compared not only with the reference code solutions, but also with the experimental data. Moreover, the paper quantifies the impact of computational grid density and time-step size (used by CFD and FW–H codes) on the final solution accuracy. Additionally, a simplified analytical code is developed (based on elementary dipole solutions, compact chord assumption and BEMT method) allowing for the initial loading noise analysis with highly reduced computational resources. The acquired results are fully compatible with the classical FW–H analysis in terms of the impact of the in-plane and out-of-plane forces on the generated noise. The FW–H code predictions of the acoustic pressure and its components are in satisfactory agreement with the reference and experimental data of Sargent and Schmitz.
Źródło:
Archives of Mechanics; 2022, 74, 2-3; 201-246
0373-2029
Pojawia się w:
Archives of Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Trim Optimisation - Theory and Practice
Autorzy:
Reichel, M.
Minchev, A.
Larsen, N. L.
Powiązania:
https://bibliotekanauki.pl/articles/116601.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Trim, Trim Optimisation
Ship Stability
Trimmed Conditions
SeaTrim® Software
computational fluid dynamics (CFD)
Theory
Practice
Opis:
Force Technology has been working intensively with trim optimisation tests for almost last 10 years. Focus has primarily been put on the possible power savings and exhaust gases reduction. This paper describes the trim optimisation process for a large cargo vessel. The physics behind changed propulsive power is described and the analyses in order to elaborate the optimum trimmed conditions are presented. Different methods for prediction of required power in trimmed conditions are presented and results are compared against each other. The methods with their advantages and disadvantages are discussed. On the basis of power prediction, a trim guidance with dedicated SeaTrim® software for ship master is made and presented.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8, 3; 387-392
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 Kummer confluent hypergeometric function and some of its applications in the theory of azimuthally magnetized circular ferrite waveguides
Autorzy:
Georgiev, G. N.
Georgieva-Grosse, M. N.
Powiązania:
https://bibliotekanauki.pl/articles/309046.pdf
Data publikacji:
2005
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
microwave propagation in anisotropic media
microwave guides and components
ferrite phase shifters
switches
isolators
eigenvalue problems
function-theoretic and computational methods in electromagnetic theory
theoretical and numerical analysis of special functions
Opis:
Examples of the application of the confluent hypergeometric functions in miscellaneous areas of the theoretical physics are presented. It is suggested these functions to be utilized as a universal means for solution of a large number of problems, leading to: cylindrical, incomplete gamma, Coulomb wave, Airy, Kelvin, Bateman, Weber's parabolic cylinder, logarithmic-integral and exponential integral functions, generalized Laguerre, Poisson-Charlier and Hermit polynomials, integral sine and cosine, Fresnel and probability integrals, etc. (whose complete list is given), which are their special cases. The employment of such an approach would permit to develop general methods for integration of these tasks, to generalize results of different directions of physics and to find the common features of various phenomena, governed by equations, pertaining to the same family. Emphasis is placed here on the use of the Kummer function in the field of microwaves: the cases of normal and slow rotationally symmetric TE modes propagation in the azimuthally magnetized circular ferrite waveguide are considered. Lemmas on the properties of the argument, real and imaginary parts, and positive purely imaginary (real) zeros of the function mentioned in the complex (real) domain, of importance in the solution of boundary-value problem stated for normal (slow) waves, are substantiated analytically or numerically. A theorem for the identity of positive purely imaginary and real zeros of the complex respectively real Kummer function for certain parameters, is proved numerically. Tables and graphs support the results established. The terms for wave transmission are obtained as four bilaterally open intervals of variation of the quantities, specifying the fields. It turns out that the normal (slow) modes may exist in one (two) region(s). The theoretically predicted phase curves for the first waves of the two TE sets examined show that the structure explored is suitable for ferrite control components design.
Źródło:
Journal of Telecommunications and Information Technology; 2005, 3; 112-128
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Koncepcje modernizacji: zarządzania długiem publicznym oraz strategii długu
Concepts of Modernization: Management of Public Debt
Концепции модернизации: управления государственным долгом и стратегии долга
Autorzy:
Klukowski, Leszek
Powiązania:
https://bibliotekanauki.pl/articles/547594.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Rzeszowski. Wydawnictwo Uniwersytetu Rzeszowskiego
Tematy:
optymalizacja zarządzania i strategii długu publicznego
zastosowanie programowania matematycznego,
teorii gier i inteligencji obliczeniowej
optimization of management and strategy of public debt
application of mathematical programming
theory of games and computational intelligence
Opis:
Wysoki lub nadmierny poziom długu publicznego stwarza stałe trudności dla finansów publicznych, m.in.: napięcia w budżecie państwa (wskutek wysokich kosztów obsługi), konieczność uruchomienia rezerw, ograniczenia w realizacji niektórych celów. Ponadto, pogarsza warunki funkcjonowania gospodarki, m.in. z powodu: zmniejszenia kredytu dla gospodarki, wzrostu opodatkowania, obniżenia ratingu (powodującego wzrost stóp procentowych). Wysoki, subkryzysowy poziom zadłużenia wymaga efektywnego – optymalnego – systemu zarządzania długiem i strategii długu. Zarządzanie polega na: określaniu poziomu i struktury długu, rodzajowej i wg wierzycieli oraz przepływów finansowych wynikających z długu. Jako podstawowy cel zarządzania przyjmuje się minimalizację kosztów obsługi, przy ograniczeniu ryzyka, głównie stopy procentowej, oraz spełnieniu warunków dotyczących pożądanych cech długu. Strategia długu uwzględnia dodatkowo cele i uwarunkowania makroekonomiczne w dłuższym horyzoncie czasu; podstawowym celem jest maksymalizacja dobrobytu. Realizacja celów zarządzania długiem i strategii długu jest złożonym problemem decyzyj-nym wymaga sformułowania spójnego zestawu problemów optymalizacyjnych. Do ich rozwiązania niezbędne jest zastosowanie metod programowania matematycznego i teorii gier. Sformułowanie numerycznej postaci problemów optymalizacyjnych wymaga też zastosowania metod analitycznych, diagnostycznych i prognostycznych, z zakresu statystyki, ekonometrii i inteligencji obliczeniowej. Istotnym składnikiem optymalizacji w zakresie długu jest ponadto wsad ekspercki. W opinii autora tego tekstu, nie jest możliwe zapewnienie rzeczywistej optymalności zarządzania i strategii długu bez zastosowania wymienionego powyżej instrumentarium. Nieoptymalność powoduje znaczące straty dla finansów publicznych, m.in. wskutek nadmiernych kosztów obsługi (ich poziom zbliża się do 50 mld zł rocznie).
High or excessive level of public debt results in permanent difficulties for public finance, especially: tension in state budget (in the consequence of high servicing costs), necessity of activation of reserves, limitation in some expenditures. Moreover, it deteriorates conditions of operating of economy, as a result of: reduction of credit, increase of taxation, decrease of rating (causing of increase of interest rates). High, subcrisis level of debt requires effective – optimal – system of management and strategy. The debt management consists of: determining of debt level and structure, accordingly to the type of instruments and creditors and financial flows resulting from the debt. The main purpose of the management is minimization of servicing costs, under constraints for risk level, especially interest rate, and satisfying of conditions about required debt features. Debt strategy takes into account macroeconomic targets and conditions; the basic is maximization of welfare. Realization of purposes of debt management is the complex decision problem – it requires formulation of coherent set of optimization problems. They can be solved with a use of mathe-matical programming methods and theory of games. Formulation of numerical form of optimization problems require application of analytic, diagnostic and forecasting methods, based on statistics, econometrics and computational intelligence. Important part of debt optimization is also experts’ component. In the author opinion it is not possible to guarantee actual optimization of debt management and strategy without application of the mentioned above methodology. Lack of optimality indicates significant losses for the public finance, especially as a result of excessive servicing costs (their level approach the level of 50 milliards of Polish zlotys).
Źródło:
Nierówności Społeczne a Wzrost Gospodarczy; 2016, 46; 135-147
1898-5084
2658-0780
Pojawia się w:
Nierówności Społeczne a Wzrost Gospodarczy
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 18

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