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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 36
Tytuł:
Semantics and symbol grounding in Turing machine processes
Autorzy:
Sarosiek, Anna
Powiązania:
https://bibliotekanauki.pl/articles/429109.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Papieski Jana Pawła II w Krakowie
Tematy:
Steven Harnad
symbolic system
semantic system
symbol grounding problem
Turing machine
Turing test
Church-Turing Thesis
artificial intelligent
cognition
Opis:
The aim of the paper is to present the underlying reason of the unsolved symbolgrounding problem. The Church-Turing Thesis states that a physical problem,for which there is an algorithm of solution, can be solved by a Turingmachine, but machine operations neglect the semantic relationship betweensymbols and their meaning. Symbols are objects that are manipulated on rulesbased on their shapes. The computations are independent of the context, mentalstates, emotions, or feelings. The symbol processing operations are interpretedby the machine in a way quite different from the cognitive processes.Cognitive activities of living organisms and computation differ from each other,because of the way they act in the real word. The result is the problem ofmutual understanding of symbol grounding.
Źródło:
Semina Scientiarum; 2017, 16
1644-3365
Pojawia się w:
Semina Scientiarum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Understanding, Expression and Unwelcome Logic
Autorzy:
Holub, Štěpán
Powiązania:
https://bibliotekanauki.pl/articles/1796970.pdf
Data publikacji:
2020
Wydawca:
Polskie Towarzystwo Semiotyczne
Tematy:
mechanism
Gödel’s theorem
Turing machine
hermeneutics
Opis:
In this paper I will attempt to explain why the controversy surrounding the alleged refutation of Mechanism by Gödel’s theorem is continuing even after its unanimous refutation by logicians. I will argue that the philosophical point its proponents want to establish is a necessary gap between the intended meaning and its formulation. Such a gap is the main tenet of philosophical hermeneutics. While Gödel’s theorem does not disprove Mechanism, it is nevertheless an important illustration of the hermeneutic principle. The ongoing misunderstanding is therefore based in a distinction between a metalogical illustration of a crucial feature of human understanding, and a logically precise, but wrong claim. The main reason for the confusion is the fact that in order to make the claim logically precise, it must be transformed in a way which destroys its informal value. Part of this transformation is a clear distinction between the Turing Machine as a mathematical object and a machine as a physical device.
Źródło:
Studia Semiotyczne; 2020, 34, 1; 183-202
0137-6608
Pojawia się w:
Studia Semiotyczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Models of quantum computation and quantum programming languages
Autorzy:
Miszczak, J.
Powiązania:
https://bibliotekanauki.pl/articles/200159.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
programming languages
models of computation
Turing machine
Opis:
The goal of the presented paper is to provide an introduction to the basic computational models used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine (QRAM) along with their classical counterparts. We also provide an introduction to quantum programming languages, which are developed using the QRAM model. We review the syntax of several existing quantum programming languages and discuss their features and limitations.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 3; 305-324
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Turing machine approach to runtime software adaptation
Autorzy:
Rudy, J.
Powiązania:
https://bibliotekanauki.pl/articles/952943.pdf
Data publikacji:
2014
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
runtime change
dynamic modification
computability theory
turing machines
Opis:
In this paper, the problem of applying changes to software at runtime is considered. The computability theory is used in order to develop a more general and programming-language-independent model of computation with support for runtime changes. Various types of runtime changes were defined in terms of computable functions and Turing machines. The properties of such functions and machines were used to prove that arbitrary runtime changes on Turing machines are impossible in general cases. A method of Turing machine decomposition into subtasks was presented and runtime changes were defined through transformations of the subtask graph. Requirements for the possible changes were considered with regard to the possibility of subtask execution during such changes. Finally, a runtime change model of computation was defined by extension of the Universal Turing Machine.
Źródło:
Computer Science; 2014, 15 (3); 293-310
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Relativized helping operators
Autorzy:
Cintioli, P.
Powiązania:
https://bibliotekanauki.pl/articles/1964198.pdf
Data publikacji:
2005
Wydawca:
Politechnika Gdańska
Tematy:
oracle Turing machines
structural complexity
relativizes separations
helping
Opis:
Schöning and Ko respectively introduced the concepts of helping and one-side-helping, and then defined new operators, Phelp(•) and P1-help(•), acting on classes of sets C and returning classes of sets Phelp(C) and P1-help(C). A number of results have been obtained on this subject, principally devoted to understanding how wide the Phelp(C) and P1-help(C) classes are. For example, it seems that the Phelp(•) operator contracts NP ∩ coNP}, while the P1-help(•) operator enlarges UP. To better understand the relative power of P1-help(•) versus Phelp(•) we propose to search, for every relativizable class D containing P, the largest relativizable class C containing P such that for every oracle B PBhelp(CB)? PB1-help(DB). In the following paper: Cintioli P. and Silvestri R. 1997 Inf. Proc. Let. 61 189, it has been observed that Phelp(UP ∩ coUP)= P1-help(UP ∩ coUP), and this is true in any relativized world. In this paper we consider the case of D=UP ∩ coUP and demonstrate the existence of an oracle A for which PAhelp(UPA2 ∩ coUPA2) is not contained in PA1-help(UPA ∩ coUPA). We also prove that for every integer k ≥ 2 there exists an oracle A such that PAhelp(UPAk ∩ coUPAk) ? UPAk.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2005, 9, 3; 357-367
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Enigma : życie i śmierć Alana Turinga
Autorzy:
Hodges, Andrew.
Współwytwórcy:
Bartol, Wiktor. Tłumaczenie
Ciesielski, Krzysztof. Recenzja
Data publikacji:
2002
Wydawca:
Warszawa : Prószyński i S-ka
Tematy:
Turing Alan M.
Turing Alan M. (1912-1954) biografia recenzja
Enigma (maszyna szyfrująca) recenzja
Matematycy biografie Wielka Brytania 20 w. recenzja
Opis:
Matematyk brytyjski. W okresie II wojny światowej zajmował się konstrukcją maszyn deszyfrujących.
Oryg.: "Alan Turing: the Enigma".
Dostawca treści:
Bibliografia CBW
Książka
Tytuł:
Immersion level and bot player identification in a multiplayer online game: The World of Warships case study
Poziom immersji a identyfikowanie botów w wieloosobowej grze online — studium przypadku gry World of Warships
Autorzy:
Łupkowski, Paweł
Krajewska, Violetta
Powiązania:
https://bibliotekanauki.pl/articles/1367799.pdf
Data publikacji:
2019-02-12
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
immersja
wieloosobowe gry online
identyfikacja botów
unsuspecting Turing Test
Opis:
In this paper we present the results of an experimental study of bot identification in a multiplayer online game. Our game of choice for the study was World of Warships. The tested group consisted of 30 subjects (15 experienced players and 15 players without significant experience in this domain). Subjects played the game against bots or against human players. The main hypothesis for the study was that the more immersed a player was, the less accurate s/he will identify the opposing players (as human players or as bots). On the basis of the results, this hypothesis cannot be confirmed.
W artykule przedstawiamy wyniki badania poświęconego identyfikacji graczy-botów w wieloosobowej grze online. Badanie zostało przeprowadzone z wykorzystaniem gry World of Warships. Grupa badana składała się z 30 osób (15 doświadczonych graczy oraz 15 osób z niewielkim doświadczeniem w grach). Badani grali w grę przeciwko botom lub ludziom. Główną hipotezą badawczą przyjętą przez nas na potrzeby badania było przypuszczenie, że im wyższy poziom immersji osiągnie gracz, tym mniej trafnie będzie rozpoznawał graczy, przeciwko którym gra (jako ludzi lub boty). Hipoteza ta nie znajduje potwierdzenia w wynikach badania.
Źródło:
Homo Ludens; 2018, 1, 11; 155-171
2080-4555
Pojawia się w:
Homo Ludens
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Paradygmat obiektowy w oprogramowaniu astronomicznym
Autorzy:
Janusz, Robert
Powiązania:
https://bibliotekanauki.pl/articles/429277.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Papieski Jana Pawła II w Krakowie
Tematy:
object oriented paradigm
scientific software
Turing Machine
knowledge
mathematical model
Opis:
To create an astronomical software, one should use the most effective method to produce the quickest hardware calculation. However, the not so effective object oriented paradigm seems to have bigger influence on the astronomical domain. We discuss the status quo of its methodology. The traditional, Turing computation model does not have so distinct influence on knowledge creation because it is hardware-oriented. An object oriented programming language is more influential on discovery, because it works directly in the scientific domain.
Źródło:
Semina Scientiarum; 2018, 17
1644-3365
Pojawia się w:
Semina Scientiarum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic Turing Machine: model and properties for runtime code changes
Autorzy:
Rudy, J.
Powiązania:
https://bibliotekanauki.pl/articles/305728.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
computability theory
models of computation
Turing machine
runtime code changes
Opis:
In this paper, a dynamic model of computation based on the Universal Turing Machine is proposed. This model is capable of applying runtime code modifications for 3-symbol deterministic Turing Machines at runtime and requires a decomposition of the simulated machine into parts called subtasks. The algorithm for performing runtime changes is considered, and the ability to apply runtime changes is studied through computer simulations. Theoretical properties of the proposed model, including computational power as well as time and space complexity, are studied and proven. Connections between the proposed model and Oracle Machines are discussed. Moreover, a possible method of implementation in real-life systems is proposed.
Źródło:
Computer Science; 2016, 17 (2); 187-224
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Perspective on Turing paradigm: An essay
Autorzy:
Trzęsicki, Kazimierz
Powiązania:
https://bibliotekanauki.pl/articles/28763393.pdf
Data publikacji:
2022
Wydawca:
Copernicus Center Press
Tematy:
Galileo Galilei
Alan Turing
Konrad Zuse
zero
Arabic numeral
paradigm
mathematics
algorithmics
Opis:
Scientific knowledge is acquired according to some paradigm. Galileo wrote that the “book of nature” was written in mathematical language and could not be understood unless one first understood the language and recognized the characters with which it was written. It is argued that Turing planted the seeds of a new paradigm. According to the Turing Paradigm, the “book of nature” is written in algorithmic language, and science aims to learn how the algorithms change the physical, social, and human universe. Some sources of the Turing Paradigm are pointed out, and a few examples of the application of the Turing Paradigm are discussed.
Źródło:
Zagadnienia Filozoficzne w Nauce; 2022, 73; 281-332
0867-8286
2451-0602
Pojawia się w:
Zagadnienia Filozoficzne w Nauce
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ł:
Die Digitalisierung von Lesen und Schreiben und deren kulturellen Auswirkungen
Autorzy:
Lobin, Henning
Powiązania:
https://bibliotekanauki.pl/articles/700277.pdf
Data publikacji:
2012
Wydawca:
Stowarzyszenie Germanistów Polskich
Tematy:
Digitalization, cultural effects, cultural revolution, Turing Galaxy, cultural skills, multimodality, automation, networking
Opis:
The digitization of reading and writing and their cultural impactWe had found ourselves in the “Gutenberg-Galaxy” before the digitalization made its rise. The development of the book printing by Johannes Gutenberg and developments based on it as well as the following industrialization of printing are decisive for the expansion of the cultural revolution. It has meanwhile been transformed, upgraded and replaced by something which has been called “Turing Galaxy”. One of the most important changes is the automatic processing of data, the program-controlled production or manipulation of texts, images, sounds, formulas, tables and videos. The internet has led us to new distribution channels. The paper shows which trends of development concerning the cultural skills of writing and reading have been realized up to now as a result of the digitalization. Three aspects of development will be discussed: how the way of writing has changed to the present moment by the means of automation, multimodality and networking.
Źródło:
Zeitschrift des Verbandes Polnischer Germanisten; 2012, 1, 2
2353-656X
2353-4893
Pojawia się w:
Zeitschrift des Verbandes Polnischer Germanisten
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Turing’s Wager?
Autorzy:
Copeland, B. Jack
Proudfoot, Diane
Powiązania:
https://bibliotekanauki.pl/articles/31233733.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Instytut Filozofii i Socjologii PAN
Tematy:
Alan Turing
Turing’s Wager
mechanized encryption
laws of behaviour
unspecifiability of the mind
brain modelling
whole-brain simulation
cipher machines
Enigma
fish
Tunny
early computer-based cryptography
Opis:
We examine Turing’s intriguing claim, made in the philosophy journal Mind, that he had created a short computer program of such a nature that it would be impossible “to discover by observation sufficient about it to predict its future behaviour, and this within a reasonable time, say a thousand years” (Turing, 1950, p. 457). A program like this would naturally have cryptographic applications, and we explore how the program would most likely have functioned. Importantly, a myth has recently grown up around this program of Turing’s, namely that it can be used as the basis of an argument—and was so used by Turing—to support the conclusion that it is impossible to infer a detailed mathematical description of the human brain within a practicable timescale. This alleged argument of Turing’s has been dubbed “Turing’s Wager” (Thwaites, Soltan, Wieser, Nimmo-Smith, 2017, p. 3) We demonstrate that this argument—in fact nowhere to be found in Turing’s work—is worthless, since it commits a glaring logical fallacy. “Turing’s Wager” gives no grounds for pessimism about the prospects for understanding and simulating the human brain.
Źródło:
Filozofia i Nauka; 2023, 11; 23-36
2300-4711
2545-1936
Pojawia się w:
Filozofia i Nauka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Ethical Significance of Human Likeness in Robotics and AI
Autorzy:
Remmers, Peter
Powiązania:
https://bibliotekanauki.pl/articles/781479.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
AI
robotics
human likeness
anthropomorphism
ethical implications
Strong AI
Turing’s Test
autonomy.
Opis:
A defining goal of research in AI and robotics is to build technical artefacts as substitutes, assistants or enhancements of human action and decision-making. But both in reflection on these technologies and in interaction with the respective technical artefacts, we sometimes encounter certain kinds of human likenesses. To clarify their significance, three aspects are highlighted. First, I will broadly investigate some relations between humans and artificial agents by recalling certain points from the debates on Strong AI, on Turing’s Test, on the concept of autonomy and on anthropomorphism in human-machine interaction. Second, I will argue for the claim that there are no serious ethical issues involved in the theoretical aspects of technological human likeness. Third, I will suggest that although human likeness may not be ethically significant on the philosophical and conceptual levels, strategies to use anthropomorphism in the technological design of human-machine collaborations are ethically significant, because artificial agents are specifically designed to be treated in ways we usually treat humans.
Źródło:
Ethics in Progress; 2019, 10, 2; 52-67
2084-9257
Pojawia się w:
Ethics in Progress
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
O różnych sposobach rozumienia analogowości w informatyce
Autorzy:
Stacewicz, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/429157.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Papieski Jana Pawła II w Krakowie
Tematy:
continuous computations
analog computations
analogicity
GPAC model
Turing machine
natural computing
hypercomputations
computability
Opis:
Two different types of analog computations are discussed in the paper: 1)analog-continuous computations (performed physically upon continuous signals),2) analog-analogical computations (performed naturally by means of socalled natural analogons of mathematical operations). They are analyzed withregard to such questions like: a) are continuous computations physically implementable?b) what is the actual computational power of different analogtechniques? c) can natural (empirical) computations be such reliable as digital?d) is it possible to develop universal analog computers (assuming that theyshould be functionally similar to universal Turing machine)? Presented analysesare rather methodological than formal.
Źródło:
Semina Scientiarum; 2017, 16
1644-3365
Pojawia się w:
Semina Scientiarum
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 36

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