Log in

Relevant bibliographies by topics / Turing machines. Computers. Artificial intelligence / Journal articles

To see the other types of publications on this topic, follow the link: Turing machines. Computers. Artificial intelligence.

Journal articles on the topic 'Turing machines. Computers. Artificial intelligence'

Author: Grafiati

Published: 4 June 2021

Last updated: 9 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Turing machines. Computers. Artificial intelligence.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Grosz, Barbara. "What Question Would Turing Pose Today?" AI Magazine 33, no. 4 (2012): 73. http://dx.doi.org/10.1609/aimag.v33i4.2441.

Full text

Abstract:

In 1950, when Turing proposed to replace the question "Can machines think?" with the question "Are there imaginable digital computers which would do well in the imitation game?" computer science was not yet a field of study, Shannon’s theory of information had just begun to change the way people thought about communication, and psychology was only starting to look beyond behaviorism. It is stunning that so many predictions in Turing’s 1950 Mind paper were right. In the decades since that paper appeared, with its inspiring challenges, research in computer science, neuroscience, and the behavior

APA, Harvard, Vancouver, ISO, and other styles

2

ADAM, RUTH, URI HERSHBERG, YAACOV SCHUL, and SORIN SOLOMON. "TESTING THE TURING TEST — DO MEN PASS IT?" International Journal of Modern Physics C 15, no. 08 (2004): 1041–47. http://dx.doi.org/10.1142/s0129183104006522.

Full text

Abstract:

We are fascinated by the idea of giving life to the inanimate. The fields of Artificial Life and Artificial Intelligence (AI) attempt to use a scientific approach to pursue this desire. The first steps on this approach hark back to Turing and his suggestion of an imitation game as an alternative answer to the question "can machines think?".1To test his hypothesis, Turing formulated the Turing test1to detect human behavior in computers. But how do humans pass such a test? What would you say if you would learn that they do not pass it well? What would it mean for our understanding of human behav

APA, Harvard, Vancouver, ISO, and other styles

3

Kulikov, Vadim. "Preferential Engagement and What Can We Learn from Online Chess?" Minds and Machines 30, no. 4 (2020): 617–36. http://dx.doi.org/10.1007/s11023-020-09550-7.

Full text

Abstract:

AbstractAn online game of chess against a human opponent appears to be indistinguishable from a game against a machine: both happen on the screen. Yet, people prefer to play chess against other people despite the fact that machines surpass people in skill. When the philosophers of 1970’s and 1980’s argued that computers will never surpass us in chess, perhaps their intuitions were rather saying “Computers will never be favored as opponents”? In this paper we analyse through the introduced concepts of psychological affordances and psychological interplay, what are the mechanisms that make a hum

APA, Harvard, Vancouver, ISO, and other styles

4

Weng, Juyang. "Autonomous Programming for General Purposes: Theory." International Journal of Humanoid Robotics 17, no. 04 (2020): 2050016. http://dx.doi.org/10.1142/s0219843620500164.

Full text

Abstract:

The universal Turing Machine (TM) is a model for Von Neumann computers — general-purpose computers. A human brain, linked with its biological body, can inside-skull-autonomously learn a universal TM so that he acts as a general-purpose computer and writes a computer program for any practical purposes. It is unknown whether a robot can accomplish the same. This theoretical work shows how the Developmental Network (DN), linked with its robot body, can accomplish this. Unlike a traditional TM, the TM learned by DN is a super TM — Grounded, Emergent, Natural, Incremental, Skulled, Attentive, Motiv

APA, Harvard, Vancouver, ISO, and other styles

5

ITO, AKIRA, KATSUSHI INOUE, ITSUO TAKANAMI, and YUE WANG. "THE EFFECT OF INKDOTS FOR TWO-DIMENSIONAL AUTOMATA." International Journal of Pattern Recognition and Artificial Intelligence 09, no. 05 (1995): 777–96. http://dx.doi.org/10.1142/s0218001495000328.

Full text

Abstract:

Recently, related to the open problem of whether deterministic and nondeterministic space (especially lower-level) complexity classes are separated, the inkdot Turing machine was introduced. An inkdot machine is a conventional Turing machine capable of dropping an inkdot on a given input tape for a landmark, but not to pick it up nor further erase it. In this paper, we introduce a finite state version of the inkdot machine as a weak recognizer of the properties of digital pictures, rather than a Turing machine supplied with a one-dimensional working tape. We first investigate the sufficient sp

APA, Harvard, Vancouver, ISO, and other styles

6

Harel, David. "Niépce–Bell or Turing: how to test odour reproduction." Journal of The Royal Society Interface 13, no. 125 (2016): 20160587. http://dx.doi.org/10.1098/rsif.2016.0587.

Full text

Abstract:

Decades before the existence of anything resembling an artificial intelligence system, Alan Turing raised the question of how to test whether machines can think, or, in modern terminology, whether a computer claimed to exhibit intelligence indeed does so. This paper raises the analogous issue for olfaction: how to test the validity of a system claimed to reproduce arbitrary odours artificially, in a way recognizable to humans. Although odour reproduction systems are still far from being viable, the question of how to test candidates thereof is claimed to be interesting and non-trivial, and a n

APA, Harvard, Vancouver, ISO, and other styles

7

Welch, Philip. "Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines." Computability 10, no. 2 (2021): 159–80. http://dx.doi.org/10.3233/com-200301.

Full text

Abstract:

We consider how changes in transfinite machine architecture can sometimes alter substantially their capabilities. We approach the subject by answering three open problems touching on: firstly differing halting time considerations for machines with multiple as opposed to single heads, secondly space requirements, and lastly limit rules. We: 1) use admissibility theory, Σ 2 -codes and Π 3 -reflection properties in the constructible hierarchy to classify the halting times of ITTMs with multiple independent heads; the same for Ordinal Turing Machines which have On length tapes; 2) determine which

APA, Harvard, Vancouver, ISO, and other styles

8

ITO, AKIRA, KATSUSHI INOUE, ITSUO TAKANAMI, and YASUYOSHI INAGAKI. "CONSTANT LEAF-SIZE HIERARCHY OF TWO-DIMENSIONAL ALTERNATING TURING MACHINES." International Journal of Pattern Recognition and Artificial Intelligence 08, no. 02 (1994): 509–24. http://dx.doi.org/10.1142/s0218001494000267.

Full text

Abstract:

“Leaf-size” (or “branching”) is the minimum number of leaves of some accepting computation trees of alternating devices. For example, one leaf corresponds to nondeterministic computation. In this paper, we investigate the effect of constant leaves of two-dimensional alternating Turing machines, and show the following facts: (1) For any function L(m, n), k leaf- and L(m, n) space-bounded two-dimensional alternating Turing machines which have only universal states are equivalent to the same space bounded deterministic Turing machines for any integer k≥1, where m (n) is the number of rows (column

APA, Harvard, Vancouver, ISO, and other styles

9

Cook, S. D. Noam. "Turing, Searle, and the Wizard of Oz." Techné: Research in Philosophy and Technology 14, no. 2 (2010): 88–102. http://dx.doi.org/10.5840/techne201014212.

Full text

Abstract:

Since the middle of the 20th century there has been a significant debate about the attribution of capacities of living systems, particularly humans, to technological artefacts, especially computers—from Turing’s opening gambit, to subsequent considerations of artificial intelligence, to recent claims about artificial life. Some now argue that the capacities of future technologies will ultimately make it impossible to draw any meaningful distinctions between humans and machines. Such issues center on what sense, if any, it makes to claim that gadgets can actually think, feel, act, live, etc. I

APA, Harvard, Vancouver, ISO, and other styles

10

Legato, Marianne J., Francoise Simon, James E. Young, Tatsuya Nomura, and Ibis Sánchez-Serrano. "Roundtable Discussion III: The Development and Uses of Artificial Intelligence in Medicine: A Work in Progress." Gender and the Genome 4 (January 1, 2020): 247028971989870. http://dx.doi.org/10.1177/2470289719898701.

Full text

Abstract:

Humans have devised machines to replace computation by individuals since ancient times: The abacus predated the written Hindu–Arabic numeral system by centuries. We owe a quantum leap in the development of machines to help problem solve to the British mathematician Charles Babbage who built what he called the Difference Engine in the mid-19th century. But the Turing formula created in 1936 is the foundation for the modern computer; it produced printed symbols on paper tape that listed a series of logical instructions. Three decades later, Olivetti manufactured the first mass-marketed desktop c

APA, Harvard, Vancouver, ISO, and other styles

11

MORITA, KENICHI, YASUNORI YAMAMOTO, and KAZUHIRO SUGATA. "TWO-DIMENSIONAL THREE-WAY ARRAY GRAMMARS AND THEIR ACCEPTORS." International Journal of Pattern Recognition and Artificial Intelligence 03, no. 03n04 (1989): 353–76. http://dx.doi.org/10.1142/s0218001489000280.

Full text

Abstract:

Two kinds of three-way isometric array grammars arc proposed as subclasses of an isometric monotonic array grammar. They are a three-way horizontally context-sensitive array grammar (3HCSAG) and a three-way immediately terminating array grammar (3ITAG). In these three-way grammars, patterns of symbols can grow only in the leftward, rightward and downward directions. We show that their generating abilities of rectangular languages are precisely characterized by some kinds of three-way two-dimensional Turing machines or related acceptors. In this paper. the following results are proved. First, 3

APA, Harvard, Vancouver, ISO, and other styles

12

Geoghegan, Bernard Dionysius. "Agents of History." Interaction Studies 9, no. 3 (2008): 403–14. http://dx.doi.org/10.1075/is.9.3.03geo.

Full text

Abstract:

World War II research into cryptography and computing produced methods, instruments and research communities that informed early research into artificial intelligence (AI) and semi-autonomous computing. Alan Turing and Claude Shannon in particular adapted this research into early theories and demonstrations of AI based on computers’ abilities to track, predict and compete with opponents. This formed a loosely bound collection of techniques, paradigms, and practices I call crypto-intelligence. Subsequent researchers such as Joseph Weizenbaum adapted crypto-intelligence but also reproduced aspec

APA, Harvard, Vancouver, ISO, and other styles

13

Chen, Melvin. "Imagination machines, Dartmouth-based Turing tests, & a potted history of responses." AI & SOCIETY 35, no. 1 (2018): 283–87. http://dx.doi.org/10.1007/s00146-018-0855-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

OKAZAKI, TOKIO, KATSUSHI INOUE, AKIRA ITO, and YUE WANG. "A NOTE ON THREE-WAY TWO-DIMENSIONAL PROBABILISTIC TURING MACHINES." International Journal of Pattern Recognition and Artificial Intelligence 14, no. 04 (2000): 477–500. http://dx.doi.org/10.1142/s0218001400000313.

Full text

Abstract:

This paper introduces a three-way two-dimensional probabilistic Turing machine (tr2-ptm), and investigates several properties of the machine. The tr2-ptm is a two-dimensional probabilistic Turing machine (2-ptm) whose input head can only move left, right, or down, but not up. Let 2-ptms (resp. tr2-ptms) denote a 2-ptm (resp. tr2-ptm) whose input tape is restricted to square ones, and let 2-PTMs(S(n)) (resp. TR2-PTMs(S(n))) denote the class of sets recognized by S(n) space-bounded 2-ptms's (resp. tr2-ptms's) with error probability less than ½, where S(n): N→N is a function of one variable n (=

APA, Harvard, Vancouver, ISO, and other styles

15

Ito, Akira, Katsushi Inoue, and Yue Wang. "Nonclosure Properties of Two-Dimensional One-Marker Automata." International Journal of Pattern Recognition and Artificial Intelligence 11, no. 07 (1997): 1025–50. http://dx.doi.org/10.1142/s0218001497000469.

Full text

Abstract:

Several nonclosure properties of each class of sets accepted by two-dimensional alternating one-marker automata, alternating one-marker automata with only universal states, nondeterministic one-marker automata, deterministic one-marker automata, alternating finite automata, and alternating finite automata with only universal states are shown. To do this, we first establish the upper bounds of the working space used by "three-way" alternating Turing machines with only universal states to simulate those "four-way" non-storage machines. These bounds provide us a simplified and unified proof metho

APA, Harvard, Vancouver, ISO, and other styles

16

Miguet, Serge, Annick Montanvert, and P. S. P. Wang. "Preface." International Journal of Pattern Recognition and Artificial Intelligence 11, no. 07 (1997): 1023–24. http://dx.doi.org/10.1142/s0218001497000676.

Full text

Abstract:

Several nonclosure properties of each class of sets accepted by two-dimensional alternating one-marker automata, alternating one-marker automata with only universal states, nondeterministic one-marker automata, deterministic one-marker automata, alternating finite automata, and alternating finite automata with only universal states are shown. To do this, we first establish the upper bounds of the working space used by "three-way" alternating Turing machines with only universal states to simulate those "four-way" non-storage machines. These bounds provide us a simplified and unified proof metho

APA, Harvard, Vancouver, ISO, and other styles

17

Szepietowski, Andrzej. "On three-way two-dimensional turing machines." Information Sciences 47, no. 2 (1989): 135–47. http://dx.doi.org/10.1016/0020-0255(89)90010-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Warwick, Kevin, and Huma Shah. "Can machines think? A report on Turing test experiments at the Royal Society." Journal of Experimental & Theoretical Artificial Intelligence 28, no. 6 (2015): 989–1007. http://dx.doi.org/10.1080/0952813x.2015.1055826.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

INOUE, KATSUSHI, ITSUO SAKURAMOTO, MAKOTO SAKAMOTO, and ITSUO TAKANAMI. "TWO TOPICS CONCERNING TWO-DIMENSIONAL AUTOMATA OPERATING IN PARALLEL." International Journal of Pattern Recognition and Artificial Intelligence 06, no. 02n03 (1992): 211–25. http://dx.doi.org/10.1142/s0218001492000126.

Full text

Abstract:

This paper deals with two topics concerning two-dimensional automata operating in parallel. We first investigate a relationship between the accepting powers of two-dimensional alternating finite automata (2-AFAs) and nondeterministic bottom-up pyramid cellular acceptors (NUPCAs), and show that Ω ( diameter × log diameter ) time is necessary for NUPCAs to simulate 2-AFAs. We then investigate space complexity of two-dimensional alternating Turing machines (2-ATMs) operating in small space, and show that if L (n) is a two-dimensionally space-constructible function such that lim n → ∞ L (n)/ loglo

APA, Harvard, Vancouver, ISO, and other styles

20

Peter Berrar, Daniel, and Alfons Schuster. "Computing machinery and creativity: lessons learned from the Turing test." Kybernetes 43, no. 1 (2014): 82–91. http://dx.doi.org/10.1108/k-08-2013-0175.

Full text

Abstract:

Purpose – The purpose of this paper is to investigate the relevance and the appropriateness of Turing-style tests for computational creativity. Design/methodology/approach – The Turing test is both a milestone and a stumbling block in artificial intelligence (AI). For more than half a century, the “grand goal of passing the test” has taught the authors many lessons. Here, the authors analyze the relevance of these lessons for computational creativity. Findings – Like the burgeoning AI, computational creativity concerns itself with fundamental questions such as “Can machines be creative?” It is

APA, Harvard, Vancouver, ISO, and other styles

21

PETRY, FREDERICK E., and BERTRAND DANIEL DUNAY. "AUTOMATIC PROGRAMMING AND PROGRAM MAINTENANCE WITH GENETIC PROGRAMMING." International Journal of Software Engineering and Knowledge Engineering 05, no. 02 (1995): 165–77. http://dx.doi.org/10.1142/s0218194095000095.

Full text

Abstract:

Automatic programming is discussed in the context of software engineering. An approach to automatic programming is presented, which utilizes software engineering principles in the synthesis and maintenance of programs. As a simple demonstration, program-equivalent Turing machines are synthesized, encapsulated, reused, and maintained by genetic programming. Turing machines are synthesized from input-output pairs for a variety of simple problems. When a problem is solved, the solution is encapsulated and becomes part of a software library. The genetic program uses the library to solve new proble

APA, Harvard, Vancouver, ISO, and other styles

22

Wheeler, Michael. "Plastic machines: behavioural diversity and the Turing test." Kybernetes 39, no. 3 (2010): 466–80. http://dx.doi.org/10.1108/03684921011036187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Reggia, James A., Jason D. Lohn, and Hui-Hsien Chou. "Self-Replicating Structures: Evolution, Emergence, and Computation." Artificial Life 4, no. 3 (1998): 283–302. http://dx.doi.org/10.1162/106454698568594.

Full text

Abstract:

Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this work has focused on abstract logical machines (automata) embedded in two-dimensional cellular spaces. This research was motivated by the desire to understand the basic information-processing principles underlying self-replication, the potential long-term applications of programmable self-replicating machines, and the possibility of gaining insight into biological replication and the origins of life. We view past research as taking thr

APA, Harvard, Vancouver, ISO, and other styles

24

OKAZAKI, TOKIO, KATSUSHI INOUE, AKIRA ITO, and YUE WANG. "SPACE HIERARCHIES OF TWO-DIMENSIONAL ALTERNATING TURING MACHINES, PUSHDOWN AUTOMATA AND COUNTER AUTOMATA." International Journal of Pattern Recognition and Artificial Intelligence 13, no. 04 (1999): 503–21. http://dx.doi.org/10.1142/s0218001499000306.

Full text

Abstract:

This paper investigates the space hierarchies of the language classes for two-dimensional Turing machines (2-TM's), two-dimensional pushdown automata (2-PDA's) and two-dimensional counter automata (2-CA's) with small space. We show that (1) if L(n) is space constructible by a 2-TM, L(n) ≤ log n and L′(n) = o(L(n)), then strong 2-DSPACE(L(n)) – weak 2-ASPACE(L′(n)) ≠ ∅, (2) if L(n) is space constructible by a 2-PDA, L(n) ≤ log n and L′(n) = o(L(n)), then strong 2-DPDA(L(n)) – weak 2-ASPACE(L′(n)) ≠ ∅, and (3) if L(n) is space-constructible by a 2-CA, L(n) ≤ n and L′(n) = o(L(n)), then strong 2-

APA, Harvard, Vancouver, ISO, and other styles

25

ITO, AKIRA, KATSUSHI INOUE, and ITSUO TAKANAMI. "THE SIMULATION OF TWO-DIMENSIONAL ONE-MARKER AUTOMATA BY THREE-WAY TURING MACHINES." International Journal of Pattern Recognition and Artificial Intelligence 03, no. 03n04 (1989): 393–404. http://dx.doi.org/10.1142/s0218001489000309.

Full text

Abstract:

We denote a two-dimensional deterministic (nondeterministic) one-marker automaton by 2-DM1 (2-NM1), and a three-way two-dimensional deterministic (nondeterministic) Turing machine by TR2-DTM (TR2-NTM). In this paper, we show that the necessary and sufficient space for TR2-NTMs to simulate 2-DM1s (2-NM1s) is n log n (n2), and the necessary and sufficient space for TR2-DTMs to simulate 2-DM1s (2-NM1s) is 2O(n log n) (2 O(n2)), where n is the number of columns of rectangular input tapes.

APA, Harvard, Vancouver, ISO, and other styles

26

Szepietowski, Andrzej. "On space functions constructed by two-dimensional turing machines." Information Sciences 60, no. 1-2 (1992): 177–83. http://dx.doi.org/10.1016/0020-0255(92)90010-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Inoue, Atsuyuki, Katsushi Inoue, Akira Ito, Yue Wang, and Tokio Okazaki. "A note on one-pebble two-dimensional Turing machines." Information Sciences 162, no. 3-4 (2004): 295–314. http://dx.doi.org/10.1016/j.ins.2003.09.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Ito, Akira, Katsushi Inoue, and Itsuo Takanami. "A note on three-way two-dimensional alternating Turing machines." Information Sciences 45, no. 1 (1988): 1–22. http://dx.doi.org/10.1016/0020-0255(88)90005-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

GABBRIELLI, MAURIZIO, JACOPO MAURO, MARIA CHIARA MEO, and JON SNEYERS. "Decidability properties for fragments of CHR." Theory and Practice of Logic Programming 10, no. 4-6 (2010): 611–26. http://dx.doi.org/10.1017/s1471068410000311.

Full text

Abstract:

AbstractWe study the decidability of termination for two CHR dialects which, similarly to the Datalog like languages, are defined by using a signature which does not allow function symbols (of arity > 0). Both languages allow the use of the = built-in in the body of rules, thus are built on a host language that supports unification. However each imposes one further restriction. The first CHR dialect allows only range-restricted rules, that is, it does not allow the use of variables in the body or in the guard of a rule if they do not appear in the head. We show that the existence of an infi

APA, Harvard, Vancouver, ISO, and other styles

30

Sakamoto, Makoto, Akira Ito, Katsushi Inoue, and Itsuo Takanami. "Simulation of three-dimensional one-marker automata by five-way Turing machines." Information Sciences 77, no. 1-2 (1994): 77–99. http://dx.doi.org/10.1016/0020-0255(94)90049-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Inoue, K. "A space-hierarchy result on two-dimensional alternating Turing machines with only universal states." Information Sciences 35, no. 1 (1985): 79–90. http://dx.doi.org/10.1016/0020-0255(85)90042-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Sakamoto, Makoto, Katsushi Inoue, and Itsuo Takanami. "A note on three-dimensional alternating Turing machines with space smaller than log m." Information Sciences 72, no. 3 (1993): 225–49. http://dx.doi.org/10.1016/0020-0255(93)90092-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

MORITA, KENICHI, SATOSHI UENO, and KATSUNOBU IMAI. "CHARACTERIZING THE ABILITY OF PARALLEL ARRAY GENERATORS ON REVERSIBLE PARTITIONED CELLULAR AUTOMATA." International Journal of Pattern Recognition and Artificial Intelligence 13, no. 04 (1999): 523–38. http://dx.doi.org/10.1142/s0218001499000318.

Full text

Abstract:

A PCAAG introduced by Morita and Ueno is a parallel array generator on a partitioned cellular automaton (PCA) that generates an array language (i.e. a set of symbol arrays). A "reversible" PCAAG (RPCAAG) is a backward deterministic PCAAG, and thus parsing of two-dimensional patterns can be performed without backtracking by an "inverse" system of the RPCAAG. Hence, a parallel pattern recognition mechanism on a deterministic cellular automaton can be directly obtained from a RPCAAG that generates the pattern set. In this paper, we investigate the generating ability of RPCAAGs and their subclass.

APA, Harvard, Vancouver, ISO, and other styles

34

Still, Arthur, and Mark d’Inverno. "Can Machines Be Artists? A Deweyan Response in Theory and Practice." Arts 8, no. 1 (2019): 36. http://dx.doi.org/10.3390/arts8010036.

Full text

Abstract:

To speak comfortably of the machine artist (as outlined in the call for papers for this Special Issue) makes key assumptions about what it is to be an artist. It assumes, for instance, that the experience of living as an artist, which includes the socialisation, hard work, single-mindedness, and focused energy of creative activity, is incidental rather than essential since these aspects are not comfortably applicable to machines. Instead, it supposes that what is essential is the artistic product, and it is the similarity of human and machine products that makes it possible to speak of machine

APA, Harvard, Vancouver, ISO, and other styles

35

Kirichenko, N. "The ideology of information and computer technology as a vector of development of intellectual resources in a digital society." Fundamental and applied researches in practice of leading scientific schools 31, no. 1 (2019): 84–88. http://dx.doi.org/10.33531/farplss.2019.1.18.

Full text

Abstract:

The relevance of the study of this problem is that information and computer technologies contribute to the development of digital society, based on the development of human resources that are intellectual capital. Information and computer technology affect the development of machines that replaced people and gave rise to "technological unemployment." The purpose of the study is to show how the information revolution of the twenty-first century contributes to the reduction of labor as a result of progressive robotization. The technologies that are used today to replace people are different; the

APA, Harvard, Vancouver, ISO, and other styles

36

Poggio, Tomaso, and Ethan Meyers. "Turing++ Questions: A Test for the Science of (Human) Intelligence." AI Magazine 37, no. 1 (2016): 73–77. http://dx.doi.org/10.1609/aimag.v37i1.2641.

Full text

Abstract:

It is becoming increasingly clear that there is an infinite number of definitions of intelligence. Machines that are intelligent in different narrow ways have been built since the 50s. We are entering now a golden age for the engineering of intelligence and the development of many different kinds of intelligent machines. At the same time there is a widespread interest among scientists in understanding a specific and well defined form of intelligence, that is human intelligence. For this reason we propose a stronger version of the original Turing test. In particular, we describe here an open-en

APA, Harvard, Vancouver, ISO, and other styles

37

Gerla, Giangiacomo. "Fuzzy Turing machines: Normal form and limitative theorems." Fuzzy Sets and Systems 333 (February 2018): 87–105. http://dx.doi.org/10.1016/j.fss.2017.01.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Bedregal, Benjamín Callejas, and Santiago Figueira. "On the computing power of fuzzy Turing machines." Fuzzy Sets and Systems 159, no. 9 (2008): 1072–83. http://dx.doi.org/10.1016/j.fss.2007.10.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Ito, Takao, Makoto Sakamoto, Hiroshi Furutani, Michio Kono, and Satoshi Ikeda. "Three-dimensional parallel Turing machines." Artificial Life and Robotics 13, no. 1 (2008): 364–67. http://dx.doi.org/10.1007/s10015-008-0500-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Burgin, Mark, Eugene Eberbach, and Rao Mikkilineni. "Processing Information in the Clouds." Proceedings 47, no. 1 (2020): 25. http://dx.doi.org/10.3390/proceedings2020047025.

Full text

Abstract:

Cloud computing makes the necessary resources available to the appropriate computation to improve scaling, resiliency, and the efficiency of computations. This makes cloud computing a new paradigm for computation by upgrading its artificial intelligence (AI) to a higher order. To explore cloud computing using theoretical tools, we use cloud automata as a new model for computation. Higher-level AI requires infusing features of the human brain into AI systems such as incremental learning all the time. Consequently, we propose computational models that exhibit incremental learning without stoppin

APA, Harvard, Vancouver, ISO, and other styles

41

Burgin, Mark, Eugene Eberbach, and Rao Mikkilineni. "Processing Information in the Clouds." Proceedings 47, no. 1 (2020): 25. http://dx.doi.org/10.3390/proceedings47010025.

Full text

Abstract:

Cloud computing makes the necessary resources available to the appropriate computation to improve scaling, resiliency, and the efficiency of computations. This makes cloud computing a new paradigm for computation by upgrading its artificial intelligence (AI) to a higher order. To explore cloud computing using theoretical tools, we use cloud automata as a new model for computation. Higher-level AI requires infusing features of the human brain into AI systems such as incremental learning all the time. Consequently, we propose computational models that exhibit incremental learning without stoppin

APA, Harvard, Vancouver, ISO, and other styles

42

Li, Yongming. "Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency." Fuzzy Sets and Systems 160, no. 23 (2009): 3453–74. http://dx.doi.org/10.1016/j.fss.2009.08.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Vivek Tammineedi, Venkata Satya, and V. N. Rajavarman. "A Novel Analysis of Advanced Visual Cryptography Techniques for Providing Security Against Web Attacks Using Support Vector Machine Technique." Journal of Computational and Theoretical Nanoscience 17, no. 5 (2020): 2097–114. http://dx.doi.org/10.1166/jctn.2020.8855.

Full text

Abstract:

In today’s internet applications such as some real time application services like core banking and other public service oriented application have been major issue in authentication of user specification. To perform online dictionary attacks, passwords have been used for security and authentication mechanism. Present days, hacking of databases on web oriented applications is unavoidable to access them easily. Data maintenance is a complex task in internet applications. To solve these type of problems in internet applications, in this paper, we proposed a novel Integrated and Dynamic CAPTCHA (Co

APA, Harvard, Vancouver, ISO, and other styles

44

Haikonen, Pentti O. A. "On Artificial Intelligence and Consciousness." Journal of Artificial Intelligence and Consciousness 07, no. 01 (2020): 73–82. http://dx.doi.org/10.1142/s2705078520500046.

Full text

Abstract:

The popular expectation is that Artificial Intelligence (AI) will soon surpass the capacities of the human mind and Strong Artificial General Intelligence (AGI) will replace the contemporary Weak AI. However, there are certain fundamental issues that have to be addressed before this can happen. There can be no intelligence without understanding, and there can be no understanding without getting meanings. Contemporary computers manipulate symbols without meanings, which are not incorporated in the computations. This leads to the Symbol Grounding Problem; how could meanings be incorporated? The

APA, Harvard, Vancouver, ISO, and other styles

45

Wheeler, Michael. "Deceptive Appearances: the Turing Test, Response-Dependence, and Intelligence as an Emotional Concept." Minds and Machines 30, no. 4 (2020): 513–32. http://dx.doi.org/10.1007/s11023-020-09533-8.

Full text

Abstract:

AbstractThe Turing Test is routinely understood as a behaviourist test for machine intelligence. Diane Proudfoot (Rethinking Turing’s Test, Journal of Philosophy, 2013) has argued for an alternative interpretation. According to Proudfoot, Turing’s claim that intelligence is what he calls ‘an emotional concept’ indicates that he conceived of intelligence in response-dependence terms. As she puts it: ‘Turing’s criterion for “thinking” is…: x is intelligent (or thinks) if in the actual world, in an unrestricted computer-imitates-human game, x appears intelligent to an average interrogator’. The r

APA, Harvard, Vancouver, ISO, and other styles

46

Cogburn, Jon, and Jason Megil. "Are Turing Machines Platonists? Inferentialism and the Computational Theory of Mind." Minds and Machines 20, no. 3 (2010): 423–39. http://dx.doi.org/10.1007/s11023-010-9203-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

MONTERO, CALKIN A. S., and KENJI ARAKI. "HUMAN CHAT AND SELF-ORGANIZED CRITICALITY: A CHANCE DISCOVERY APPLICATION." New Mathematics and Natural Computation 01, no. 03 (2005): 407–20. http://dx.doi.org/10.1142/s179300570500024x.

Full text

Abstract:

It has been said that there is something deeply touching about creating something and then having a chat with it. Machines in general, and more specifically computers, are not the exception to that tendency. In fact, since the Turing dissertation "Computing Machinery and Intelligence", machines' ability to perform a human-like conversational behavior has been regarded as the basis to consider the machines as "intelligent entities". In this paper, we propose the idea of the discovery of critically self-organized interaction, using its inherent structure as the basis to modeling computer chat.

APA, Harvard, Vancouver, ISO, and other styles

48

Yongming Li. "Fuzzy Turing Machines: Variants and Universality." IEEE Transactions on Fuzzy Systems 16, no. 6 (2008): 1491–502. http://dx.doi.org/10.1109/tfuzz.2008.2004990.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Galofaro, Francesco, Zeno Toffano, and Bich-Liên Doan. "A quantum-based semiotic model for textual semantics." Kybernetes 47, no. 2 (2018): 307–20. http://dx.doi.org/10.1108/k-05-2017-0187.

Full text

Abstract:

Purpose The paper aims to provide a semiotic interpretation of the role played by entanglement in quantum-based models aimed to information retrieval and suggests possible improvements. Actual models are capable of retrieving documents relevant to a query composed of a keyword and its acceptation expressed by a given context. The paper also considers some analogies between this technique and quantum-based approaches in other disciplines to discuss the consequence of this quantum turn, as epistemology and philosophy of language are concerned. Design/methodology/approach We use quantum geometry

APA, Harvard, Vancouver, ISO, and other styles

50

Nagendraswamy, C., and Salis Amogh. "A review article on artificial intelligence." Annals of Biomedical Science and Engineering 5, no. 1 (2021): 013–14. http://dx.doi.org/10.29328/journal.abse.1001012.

Full text

Abstract:

Artificial intelligence (AI) is the emulation of human intelligence in computers that have been trained to think and behave like humans. The word may also refer to any computer that exhibits human-like characteristics like learning and problem-solving. Artificial intelligence is intelligence demonstrated by machines, as opposed to natural intelligence, which involves consciousness and emotionality and is demonstrated by humans and animals [1].

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!