Filters








139,857 Hits in 3.2 sec

Finite state incompressible infinite sequences

Cristian S. Calude, Ludwig Staiger, Frank Stephan
2016 Information and Computation  
Here we use the second approach with finite transducers instead of Turing machines.  ...  Here we use the second approach with finite transducers instead of Turing machines. The lack of a universal finite transducer is not an obstacle.  ...  A universal enumeration S of all transducers is a partially computable function with prefix-free domain such that for each other prefix-free enumeration S of transducers there exists a constant c such  ... 
doi:10.1016/j.ic.2015.11.003 fatcat:g3p6qls62nc6hl2mp4ahsntsuy

Sofic profiles of S(ω ) and computability [article]

A. Ivanov
2020 arXiv   pre-print
We realize sofic profiles in the group of computable permutations of N so that the approximating morphisms can be viewed as restrictions of permutations to finite subsets of N.  ...  Let g ∈ α be sufficiently fast, for example g(n) > 30 + n. For n = 3m + i with i ∈ {0, 1} let σ n (h) coincide with h for all l < 3m and σ n (h 2 ) coincide with h 2 for all l with g(l) ≤ n.  ...  On the other hand for G = S comp α (ω) relativized statements of this proposition still make sense: one can fix a Turing degree d and consider computably enumerable groups and computably enumerable actions  ... 
arXiv:2001.02648v1 fatcat:ttsaukr7hrb2rca4wq2ypzf4pi

Page 734 of The American Historical Review Vol. 9, Issue 4 [page]

1904 The American Historical Review  
This difference between the principles of enumeration and of total restriction was an increasing one, for the growth of industry and other economic changes multiplied beyond measure the variety of articles  ...  Smith's statement is brief, Lindsay’s inaccurate in detail ; McCulloch’s is substantially correct.  ... 

An Inter-entry Invocation Selection Mechanism for Concurrent Programming Languages [chapter]

Aaron W. Keen, Ronald A. Olsson
2003 Lecture Notes in Computer Science  
Many concurrent languages provide support for multi-way receives, but they are limited in their expressive power. This paper presents three proposed inter-entry selection mechanisms.  ...  We have extended the JR programming language with support for the View Enumeration approach because of its high-level of abstraction and performance.  ...  Because View Enumeration does not rely on subclassing, this approach can also be used in concurrent languages that are not object-oriented.  ... 
doi:10.1007/978-3-540-45209-6_106 fatcat:dgmolkejy5cl5jfiaaiqzbqiei

Automatic code generation for distributed memory architectures in the polytope model

M. Classen, M. Griebl
2006 Proceedings 20th IEEE International Parallel & Distributed Processing Symposium  
However, for the final step of automatic code generation, the generated code is either only usable on shared memory architectures or severely restricts the parallelization methods that can be applied.  ...  The polytope model has been used successfully as a tool for program analysis and transformation in the field of automatic loop parallelization.  ...  We also would like to thank Cédric Bastoul for his great support with CLooG.  ... 
doi:10.1109/ipdps.2006.1639500 dblp:conf/ipps/ClassenG06 fatcat:dkessged2fek7ofcrm7zzlf6fy

Some theorems on passing from local to global presence of properties of functions

Dimiter Skordev, Jeremy Avigad
2017 Logical Methods in Computer Science  
The collections with the formulated property are said to be strongly join permitting for the given class (the notion of join permitting collection is defined in the same way, but without the words "a subset  ...  A necessary and sufficient condition for being strongly join permitting is given for the case when, for some n, the class consists of the potentially partial recursive functions of n variables, and the  ...  Acknowledgments Special thanks are due to an anonymous referee for raising a pertinent question concerning Theorem 3.1 and to Georgi Dimov for a useful discussion on this subject.  ... 
doi:10.2168/lmcs-12(4:3)2016 fatcat:7xavfdnrhnhuvjcte3uhzhb6ci

The generative capacity of transformational grammars of ginsburg and partee

Arto Salomaa
1971 Information and Control  
Any recursively enumerable language is generated by a transformational grammar with a type 3 base of trees and with no ordering or control device for the transformations.  ...  For an alphabet I, there is a set R of transformation rules such that any recursively enumerable A-free language L o over I is generated by a restricted T-grammar with a type 3 base of trees and with R  ...  STATEMENT OF THE RESULT We assume familiarity with the work of Ginsburg and Partee (1969) for some transformation rule T in the grammar.  ... 
doi:10.1016/s0019-9958(71)90364-0 fatcat:2cjl4wg3cvcedbnexg7pszb76e

Homomorphic characterizations of recursively enumerable languages with very small language classes

Satoshi Okawa, Sadaki Hirose
2001 Theoretical Computer Science  
However, with posing more restriction on L2, this result can be improved and the follwing statement is obtained. (2) L1 ∈ (1; 2) LL and L2 ∈ (1; 1) ML.  ...  In this paper, we attempt to characterize the class of recursively enumerable languages with much smaller language classes than that of linear languages.  ...  With respect to the combined restrictions on grammars, Corollary 1 and Theorem 2 were obtained. For Corollary 1, in order to restrict the class for L 1 , (1; 2) ML is the only candidate.  ... 
doi:10.1016/s0304-3975(99)00110-3 fatcat:35lcfshvgzfmdhq47ycrorva4y

Page 111 of American Annals of the Deaf Vol. 58, Issue 1 [page]

1913 American Annals of the Deaf  
Hill, chief statistician of the Census: “The enumeration of the deaf made in 1910 in connection with the Thirteenth Census was restricted to those persons who were also dumb.  ...  Bell presented the following statement from Dr. Joseph A.  ... 

The Navigation Acts As Applied to European Trade

1904 American Historical Review  
, for it furnishes a standard of comparison for England's attitude toward other powers-esp~cially as a point of departure in determining whether England discriminated against, or  ...  THE Navigation Act of 1660,' though aimed at the Dutch and intended to enable the English to displace them in the carrying-trade of the world, discriminated equally, with slight exception, against the  ...  This difference between the principles of enumeration and of total restriction was an increasing one, for the growth of industry and other economic changes multiplied beyond measure the variety of articles  ... 
doi:10.1086/ahr/9.4.725 fatcat:2q6ztmmbl5by3fhtd4zymdvtfq

Modelling Search Strategies in Rules2CP [chapter]

François Fages, Julien Martin
2009 Lecture Notes in Computer Science  
Unlike other modelling languages, Rules2CP adopts a single knowledge representation paradigm based on logical rules without recursion, and a restricted set of data structures based on records and enumerated  ...  lists given with iterators.  ...  Unlike other modelling languages, Rules2CP adopts a single knowledge representation paradigm based on logical rules without recursion, and a restricted set of data structures based on records and enumerated  ... 
doi:10.1007/978-3-642-01929-6_28 fatcat:hatukanlvzg2vohl74mfaiwfpm

Numbers of Representations in Certain Quinary Quadratic Forms

E. T. Bell
1930 American Journal of Mathematics  
to a more general statement.  ...  Restrictions consistent with any < of the foregoing will always be indicated, as, for example, m = 3 mod 4; such restrictions will apply only to the equation before which they are written.  ... 
doi:10.2307/2370681 fatcat:pxeea2i4obcshdfmgg3i6uja5a

Page 271 of American Journal of Mathematics Vol. 52, Issue 2 [page]

1930 American Journal of Mathematics  
to a more general statement.  ...  Restrictions consistent with any < of the foregoing will always be indicated, as, for example, m = 3 mod 4; such restrictions will apply only to the equation before which they are written.  ... 

The Navigation Acts as Applied to European Trade

Dudley Odell McGovney
1904 American Historical Review  
JSTOR is part of ITHAKA, a not--for--profit organization that also includes Ithaka S+R and Portico. For more information about JSTOR, please contact support@jstor.org.  ...  People may post this content online or redistribute in any way for non--commercial purposes.  ...  This difference between the principles of enumeration and of total restriction was an increasing one, for the growth of industry and other economic changes multiplied beyond measure the variety of articles  ... 
doi:10.2307/1834096 fatcat:mgc2df57fjg7ljiz25p6nbqx3q

Page 296 of American Mathematical Society. Transactions of the American Mathematical Society Vol. 82, Issue 2 [page]

1956 American Mathematical Society. Transactions of the American Mathematical Society  
296 NORMAN SHAPIRO (July function with Gédel number e is an element of C. Q@ is the restriction of Oc to the set of Gédel numbers of total 1-ary functions.  ...  If Q¢ is potentially-2-enumerable, then Qe is 3-recursive. Proof. The only if part of the first statement follows from I.11. If Q?  ... 
« Previous Showing results 1 — 15 out of 139,857 results