Informacja

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

Wyszukujesz frazę "turing" wg kryterium: Temat


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ł:
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ł:
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ł:
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ł:
Gödel’s Philosophical Challenge (to Turing)
Autorzy:
Sieg, Wilfried
Powiązania:
https://bibliotekanauki.pl/articles/1796958.pdf
Data publikacji:
2020
Wydawca:
Polskie Towarzystwo Semiotyczne
Tematy:
computability
Church's Thesis
Turing's Thesis
incompleteness
undecid-ability
Post production systems
computable dynamical systems
Opis:
The incompleteness theorems constitute the mathematical core of Gödel’s philosophical challenge. They are given in their “most satisfactory form”, as Gödel saw it, when the formality of theories to which they apply is characterized via Turing machines. These machines codify human mechanical procedures that can be carried out without appealing to higher cognitive capacities. The question naturally arises, whether the theorems justify the claim that the human mind has mathematical abilities that are not shared by any machine. Turing admits that non-mechanical steps of intuition are needed to transcend particular formal theories. Thus, there is a substantive point in comparing Turing’s views with Gödel’s that is expressed by the assertion, “The human mind infinitely surpasses any finite machine”. The parallelisms and tensions between their views are taken as an inspiration for beginning to explore, computationally, the capacities of the human mathematical mind.
Źródło:
Studia Semiotyczne; 2020, 34, 1; 57-80
0137-6608
Pojawia się w:
Studia Semiotyczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pure Infinitely Self-Modifying Code is Realizable and Turing-complete
Autorzy:
Morse, G.
Powiązania:
https://bibliotekanauki.pl/articles/227291.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
x86
x86-64
assembly language
self-modifying code
turing completeness
code obfuscation
Opis:
Although self-modifying code has been shyed away from due to its complexity and discouragement due to safety issues, it nevertheless provides for a very unique obfuscation method and a different perspective on the relationship between data and code. The generality of the von Neumann architecture is hardly realized by today’s processor models. A code-only model is shown where every instruction merely modifies other instructions yet achieves the ability to compute and Turing machine operation is easily possible.
Źródło:
International Journal of Electronics and Telecommunications; 2018, 64, 2; 123-129
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Diagonal Anti-Mechanist Arguments
Autorzy:
Kashtan, David
Powiązania:
https://bibliotekanauki.pl/articles/1796972.pdf
Data publikacji:
2020
Wydawca:
Polskie Towarzystwo Semiotyczne
Tematy:
mechanism
mind
computability
incompleteness theorems
computation-al theory of mind
the cogito
diagonal arguments
Gödel
Descartes
Tarski
Turing
Chomsky
Opis:
Gödel’s first incompleteness theorem is sometimes said to refute mechanism about the mind. §1 contains a discussion of mechanism. We look into its origins, motivations and commitments, both in general and with regard to the human mind, and ask about the place of modern computers and modern cognitive science within the general mechanistic paradigm. In §2 we give a sharp formulation of a mechanistic thesis about the mind in terms of the mathematical notion of computability. We present the argument from Gödel’s theorem against mechanism in terms of this formulation and raise two objections, one of which is known but is here given a more precise formulation, and the other is new and based on the discussion in §1.
Źródło:
Studia Semiotyczne; 2020, 34, 1; 203-232
0137-6608
Pojawia się w:
Studia Semiotyczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolving morphogenetic fields in the zebra skin pattern based on Turings morphogen hypothesis
Autorzy:
Gravan, C. P.
Lahoz-Beltra, R.
Powiązania:
https://bibliotekanauki.pl/articles/907636.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
pole morfogenetyczne
model reakcji-dyfuzji
automat komórkowy
mammalian coat pattern
morphogenetic field
Turing reaction-diffusion
evolving cellular automata
developmental models
modeling biological structures
Opis:
One of the classical problems of morphogenesis is to explain how patterns of different animals evolved resulting in a consolidated and stable pattern generation after generation. In this paper we simulated the evolution of two hypothetical morphogens, or proteins, that diffuse across a grid modeling the zebra skin pattern in an embryonic state, composed of pigmented and nonpigmented cells. The simulation experiments were carried out applying a genetic algorithm to the Young cellular automaton: a discrete version of the reaction-diffusion equations proposed by Turing in 1952. In the simulation experiments we searched for proper parameter values of two hypothetical proteins playing the role of activator and inhibitor morphogens. Our results show that on molecular and cellular levels recombination is the genetic mechanism that plays the key role in morphogen evolution, obtaining similar results in the presence or absence of mutation. However, spot patterns appear more often than stripe patterns on the simulated skin of zebras. Even when simulation results are consistent with the general picture of pattern modeling and simulation based on the Turing reaction-diffusion, we conclude that the stripe pattern of zebras may be a result of other biological features (i.e., genetic interactions, the Kipling hypothesis) not included in the present model.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 351-361
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Computational and Pragmatic Approach to the Dynamics of Science
Autorzy:
Marciszewski, Witold
Powiązania:
https://bibliotekanauki.pl/articles/41310393.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Filozofii i Socjologii PAN
Tematy:
algorithm
behavioral (vs declarative) knowledge
computability
corroboration
innate knowledge
intuition
invention
logic gates
oracle
pragmatic (vs classical) rationalism
problem-solving
reasoning
symbolic logic
Turing machine
Opis:
Science means here mathematics and those empirical disciplines which avail themselves of mathematical models. The pragmatic approach is conceived in Karl R. Popper’s The Logic of Scientific Discovery (p. 276) sense: a logical appraisal of the success of a theory amounts to the appraisal of its corroboration. This kind of appraisal is exemplified in section 6 by a case study—on how Isaac Newton justified his theory of gravitation. The computational approach in problem-solving processes consists in considering them in terms of computability: either as being performed according to a model of computation in a narrower sense, e.g., the Turing machine, or in a wider perspective—of machines associated with a non-mechanical device called “oracle” by Alan Turing (1939). Oracle can be interpreted as computertheoretic representation of intuition or invention. Computational approach in another sense means considering problem-solving processes in terms of logical gates, supposed to be a physical basis for solving problems with a reasoning. Pragmatic rationalism about science, seen at the background of classical rationalism (Descartes, Gottfried Leibniz etc.), claims that any scientific idea, either in empirical theories or in mathematics, should be checked through applications to problem-solving processes. Both the versions claim the existence of abstract objects, available to intellectual intuition. The difference concerns the dynamics of science: (i) the classical rationalism regards science as a stationary system that does not need improvements after having reached an optimal state, while (ii) the pragmatical version conceives science as evolving dynamically due to fertile interactions between creative intuitions, or inventions, with mechanical procedures. The dynamics of science is featured with various models, like Derek J. de Solla Price’s exponential and Thomas Kuhn’s paradigm model (the most familiar instances). This essay suggests considering Turing’s idea of oracle as a complementary model to explain most adequately, in terms of exceptional inventiveness, the dynamics of mathematics and mathematizable empirical sciences.
Źródło:
Filozofia i Nauka; 2020, 8, 1; 31-67
2300-4711
2545-1936
Pojawia się w:
Filozofia i Nauka
Dostawca treści:
Biblioteka Nauki
Artykuł

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