Search Results for author:
Found 12 papers, 9 papers with code
Hacking with God: a Common Programming Language of Robopsychology and Robophilosophy
It may be an interesting question in order for this game will be able to transform human thinking on the widest possible social scale and will be able to develop a standard mathematical logic-based communication channel between human and machine intelligence.
Large-scale Analysis and Simulation of Traffic Flow using Markov Models
In a real application, we have unfolded a stationary distribution on the map graph of Porto, based on the dataset.
On the notion of number in humans and machines
These measurement results can be interpreted similar to the results from SMNIST for Humans.
Benchmarking Cognitive Abilities of the Brain with Computer Games
While the user can control the character well the benchmark program will increase the visual complexity of the display.
Human-Computer Interaction
Entropy Non-increasing Games for the Improvement of Dataflow Programming
Currently, the Samu Entropy project specifies only requirements for new esport games to be developed with particular attention to the investigation of the relationship between esport and artificial intelligence.
Theoretical Robopsychology: Samu Has Learned Turing Machines
In the present paper, we investigate algorithms to write algorithms.
A disembodied developmental robotic agent called Samu Bátfai
The basic objective of this paper is to reach the same results using reinforcement learning with general function approximators that can be achieved by using the classical Q lookup table on small input samples.
Turing's Imitation Game has been Improved
Using the recently introduced universal computing model, called orchestrated machine, that represents computations in a dissipative environment, we consider a new kind of interpretation of Turing's Imitation Game.
Are there intelligent Turing machines?
This paper introduces a new computing model based on the cooperation among Turing machines called orchestrated machines.
Conscious Machines and Consciousness Oriented Programming
In this paper, we investigate the following question: how could you write such computer programs that can work like conscious beings?
Recombinations of Busy Beaver Machines
Many programmers belive that Turing-based machines cannot think.
Computational Complexity D.2.8
On the Running Time of the Shortest Programs
The Kolmogorov complexity of the word w is equal to the length of the shortest concatenation of program Z and its input x with which the word w is computed by the universal turing machine U.
Computational Complexity D.2.8
