Search academic resources

Optical computing is needed to support Tb/s in-network processing in a way that unifies communication and computation using a single data representation that supports in-transit network packet processing, security, and b...

El futuro de la singularidad tecnológica ha llegado para quedarse. Las innumerables capacidades de la IA y de la robótica son evidencias incontestables, y cada vez son más intensas e innovadoras en la vida social, eco...

El futuro de la singularidad tecnológica ha llegado para quedarse. Las innumerables capacidades de la IA y de la robótica son evidencias incontestables, y cada vez son más intensas e innovadoras en la vida social, eco...

It is a trivial fact that if we have a square table filled with numbers, we can always form a column which is not yet contained in the table. Despite its apparent triviality, this fact can lead us the most of the path-br...

In this paper we study a variant of the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of t...

Consciousness is what makes the mind-body problem really intractable. Perhaps that is why current discussions of the problem give it little attention or get it obviously wrong. The recent wave of reductionist euphoria ha...

Abstract Together with ‘On Computable Numbers’, ‘Computing Machinery and Intelligence’ forms Turing’s best-known work. This elegant and sometimes amusing essay was originally published in 1950 in the leading ph...

As Turing (1936, Proceedings of the London Mathematical Society) noted, a fundamental process in human cognition is to effect chained sequential operations in which the second operation requires an input from the precedi...

resumo Este artigo apresenta, qualitativamente, os conceitos de complexidade computacional algorítmica (Turing) e de complexidade computacional informacional (Shannon), enfatizando como pensamentos independentes, de nat...

Subjects / keywords: Turing; Computer science; Citation; Turing machine; Mathematics; Information retrieval; Library science; Algorithm; Programming language; Computation

In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to perform both update and retrieval in O(1) time simultaneously under a memory model in which individual bits may be share...

Subjects / keywords: Computer science; Cognitive science; Psychology