Sciweavers

1414 search results - page 4 / 283
» Randomness and Universal Machines
Sort
View
IJBC
2007
80views more  IJBC 2007»
13 years 7 months ago
Exact Approximations of omega Numbers
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
Cristian S. Calude, Michael J. Dinneen
ASM
2005
ASM
14 years 1 months ago
RAM Simulation of BGS Model of Abstract State Machines
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
Seshadhri Comandur, Anil Seth, Somenath Biswas