1055 search results - page 3 / 211 » Enumerations in computable structure theory |
TARK
2009
Springer
14 years 2 months ago
2009
Springer
We exhibit a new computational-based definition of awareness, informally that our level of unawareness of an object is the amount of time needed to generate that object within a ...
JCT
2011
13 years 2 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
CORR
2000
Springer
13 years 7 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
COCOON
1999
Springer
13 years 12 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
An algebraic field extension of Q or Z/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either Q or Z/(p)). We consider the ...