ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Technology
Agronomy and forestry
Industrial engineer
Computing
Pure sciences
Computing
Education
Economy
Research
Mechanical Engineering
all records (68)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
USA
Brazil
Canada
Ukraine
Romania
South Africa
Spain
Italy
Switzerland
all records (65)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
2.269  Articles
1 of 228 pages  |  10  records  |  more records»
Turing machines as a model of intelligence can be motivated under some assumptions, both mathematical and philosophical. Some of these are about the possibility, the necessity, and the limits of representing problem solving by mechanical means. The assump... see more

The article discusses the importance of studying the notion of algorithm and its formal specification using Turing machines. In the article it was identified the basic hypothesis of the theory of algorithms for Turing as well as reviewed scientific resear... see more

AbstractOn the unending path towards a better integration of the ISSN and its accompanying metadata in the semantic web, the new horizon is that of linked data, so as to make sure that ISSN data is fully linkable for universal computing. However, while st... see more

The article discusses the importance of studying the notion of algorithm and its formal specification using Turing machines. In the article it was identified the basic hypothesis of the theory of algorithms for Turing as well as reviewed scientific resear... see more

En este trabajo examino cómo el Funcionalismo de Máquina de Turing resulta compatible con una forma de dualismo, lo que aleja a la IA clásica o fuerte del materialismo que la inspiró originalmente en el siglo XIX. Para sostener esta tesis, argumento que e... see more

Starting with a remarkable private recording made by two drunken women, identified only as “Sal Boo” this essay looks at how imperfections, slips and lapses have characterized our relationship with technology. As the women jeer, curse and make lewd sugges... see more

We describe the operation of a neuronal device which embodies the computational principles of the `paper-and-pencil' machine envisioned by Alan Turing. The network is based on principles of cortical organization. We develop a plausible solution to impleme... see more

We show undecidability of hereditary history preserving simulationfor finite asynchronous transition systems by a reduction from the haltingproblem of deterministic Turing machines. To make the proof moretransparent we introduce an intermediate problem of... see more

The complexity of model checking branching and linear timetemporal logics over Kripke structures has been addressed in e.g. [SC85,CES86]. In terms of the size of the Kripke model and the length of theformula, they show that the model checking problem is s... see more

1 of 228 pages  |  10  records  |  more records»