Sciweavers

2446 search results - page 65 / 490
» Where am I
Sort
View
ECCC
2006
41views more  ECCC 2006»
13 years 10 months ago
On a syntactic approximation to logics that capture complexity classes
We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
Argimiro Arratia, Carlos E. Ortiz
MFCS
2005
Springer
14 years 3 months ago
On Beta-Shifts Having Arithmetical Languages
Let β be a real number with 1 < β < 2. We prove that the language of the β-shift is ∆0 n iff β is a ∆n-real. The special case where n is 1 is the independently inter...
Jakob Grue Simonsen
AAAI
2008
14 years 8 days ago
Game Theory Pragmatics: A Challenge for AI
Game theory has been playing an increasingly visible role in computer science in general and AI in particular, most notably in the area of multiagent systems. I briefly list the a...
Yoav Shoham
FUIN
2008
80views more  FUIN 2008»
13 years 10 months ago
An Algorithmic Solution of a Birkhoff Type Problem
We give an algorithmic solution in a simple combinatorial data of Birkhoff s type problem studied in [14], for the category repft(I, K[t]/(tm)) of filtered I-chains of modules over...
Daniel Simson, Mariusz Wojewódzki
MOC
2002
104views more  MOC 2002»
13 years 9 months ago
Numerical calculation of the density of prime numbers with a given least primitive root
In this paper the densities D(i) of prime numbers p having the least primitive root g(p) = i, where i is equal to one of the initial positive integers less than 32, have been numer...
A. Paszkiewicz, Andrzej Schinzel