Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 2

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  Banach-Mazur games
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1

Several Remarks on Banach–Mazur Games and its Applications Ewa Drabik

100%
Drabik E.
Foundations of Management
|
2013
|
vol. 5
|
issue 1
21-25
EN
Certain type of perfect information games (PI-games), the so-called Banach-Mazur games, so far have not been applied in economy. The perfect information positional game is defined as the game during which at any time the choice is made by one of the players who is acquainted with the previous decision of his opponent. The game is run on the sequential basis. The aim of this paper is to discuss selected Banach-Mazur games and to present some applications of positional game
2
Publication available in full text mode
Content available

Will a human always outsmart a computer? An essay

75%
Olszewski A.
Zagadnienia Filozoficzne w Nauce
|
2022
|
issue 73
259-280
EN
The title question of the paper has its empirical origin in the form of an individual’s existential experience arising from the personal use of a computer, which we attempt to describe in the first section. The rest of the entire paper can be understood as a philosophical essay answering the question posed. First the connection between the main problem of the article and its “premonition” by mankind, which was expressed in the form of ancient myths and legends, is briefly suggested. After shortly discussing the problems that early considerations of AI focused on, i.e. whether machines can think at all, we move on to reformulate our title question, about the possibility of outsmarting AI. This outsmarting will be understood by us in a rather limited way as to prevent a machine from completing its implemented task. To achieve this objective, after softly clarifying the basic terms, an analogy is built between the “outsmarting” of a machine by a human (the target domain) and the playing of a mathematical game between two players (the base domain), where this outsmarting is assigned a “winning strategy” in the certain game. This mathematical model is formed by games similar to Banach-Mazur games. The strict theorems of such games are then proved and applied to the target of the analogy. We then draw conclusions and look for counter-examples to our findings. The answer to the title question posed is negative, and it is not clear how far it should be taken seriously.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.