429 search results - page 65 / 86 » Turing computations on ordinals |
100
click to vote
UAI
2001
14 years 11 months ago
2001
In this paper we present a method of computing the posterior probability of conditional independence of two or more continuous variables from data, examined at several resolutions...
ENGL
2007
14 years 9 months ago
2007
This research introduces a general class of functions serving as generalized neuron models to be used in artificial neural networks. They are cast in the common framework of comp...
APAL
2010
14 years 9 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
104
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
CIE
2005
Springer
15 years 3 months ago
2005
Springer
Following Lutz’s approach to effective (constructive) dimension, we define a notion of dimension for individual sequences based on Schnorr’s concept(s) of randomness. In contr...