Zobrazeno 1 - 10
of 785
pro vyhledávání: '"Super-recursive algorithm"'
Autor:
Giangiacomo Gerla
Publikováno v:
Fuzzy Sets and Systems. 333:87-105
A normal form for fuzzy Turing machines is proposed and examined. This normal form is arithmetical in nature since the truth values are substituted by n-ples of natural numbers and the operation interpreting the conjunction becomes a sort of truncate
Autor:
Kushal Shah, Balaji Srinivasan
Publikováno v:
AI & SOCIETY. 34:145-152
Since Turing proposed the first test of intelligence, several modifications have been proposed with the aim of making Turing’s proposal more realistic and applicable in the search for artificial intelligence. In the modern context, it turns out tha
Autor:
Leo Corry
Publikováno v:
Communications of the ACM. 60:50-58
Turing's machines of 1936 were a purely mathematical notion, not an exploration of possible blueprints for physical calculators.
Autor:
Settimo Termini
Publikováno v:
Lettera Matematica. 5:185-189
The scientific activity of Alan Mathison Turing is briefly surveyed stressing the variety of his scientific interests, which are not limited to computability and the celebrated machine that bears his name. The way in which he faced all the questions
Autor:
V. N. Zakharov, V. A. Kozmidiadi
Publikováno v:
Computational Mathematics and Mathematical Physics. 57:726-738
Classes of time and space complexity of Turing machines are defined, and relationships between them are discussed. New relationships between the defined complexity classes are described.
Publikováno v:
Journal of Computer Science and Technology. 32:269-285
We have witnessed the tremendous momentum of the second spring of parallel computing in recent years. But, we should remember the low points of the field more than 20 years ago and review the lesson that has led to the question at that point whether
Autor:
Michael Grabchak, Victor Cosme
Publikováno v:
Communications in Statistics - Simulation and Computation. 46:4199-4209
Turing's formula is an amazing result that allows one to estimate the probability of observing something that has not been observed before. After a brief review of the literature, we perform a simulation study to better understand how well this formu
Autor:
Yoshiteru Ishida, Ryunosuke Chiba
Publikováno v:
KES
Free will is an important component of consciousness. Modeling an artificial consciousness requires clarifying the significance and the definition of free will. This study proposes a definition of free will similar to the epsilon-delta definition of
Autor:
E.E Ogheneovo
Publikováno v:
Advances in Multidisciplinary & Scientific Research Journal Publication. 4:1-12
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 8, Iss 2, Pp 113-170 (2016)
Parallel Communicating Grammar Systems (PCGS) were introduced as a language-theoretic treatment of concurrent systems. A PCGS extends the concept of a grammar to a structure that consists of several grammars working in parallel, communicating with ea