###
Sophisticated *Infinite* *Sequences*

"... Abstract. In this paper we revisit the notion of sophistication for infinite sequences. Koppel defined sophistication of an object as the length of the shortest (finite) total program (p) that with some (finite or infinite) data (d) produce it and |p | + |d | is smaller than the shortest description ..."

Abstract
- Add to MetaCart

Abstract. In this paper we revisit the notion of sophistication for

*infinite**sequences*. Koppel defined sophistication of an object as the length of the shortest (finite) total program (p) that with some (finite or*infinite*) data (d) produce it and |p | + |d | is smaller than the shortest###
Possibly *Infinite* *Sequences* in . . .

- IN LECTURE NOTES IN COMPUTER SCIENCE 1275: PROCEEDINGS OF THE 10TH INTERNATIONAL CONFERENCE, TPHOLS '97
, 1997

"... We compare four different formalizations of possibly infinite sequences in theorem provers based on higher-order logic. The formalizations have been carried out in different proof tools, namely in Gordon's HOL, in Isabelle and in PVS. The comparison considers different logics and proof infrast ..."

Abstract
- Add to MetaCart

We compare four different formalizations of possibly

*infinite**sequences*in theorem provers based on higher-order logic. The formalizations have been carried out in different proof tools, namely in Gordon's HOL, in Isabelle and in PVS. The comparison considers different logics and proof###
*Infinite* *sequences* in stability theory

, 2006

"... We take a tour through some uses of independence in stability theory. The unifying theme is infinite sequences. In particular, we develop the basic theory of independent sequences, Morley sequences, indiscernible sequences, Shelah trees, F-isolation and stationary sets. The essay ends with a proof t ..."

Abstract
- Add to MetaCart

We take a tour through some uses of independence in stability theory. The unifying theme is

*infinite**sequences*. In particular, we develop the basic theory of independent*sequences*, Morley*sequences*, indiscernible*sequences*, Shelah trees, F-isolation and stationary sets. The essay ends with a proof###
*Infinite* *sequences* in the framework of classical logic

, 804

"... Infinite sequences are considered in the framework of classical logic from a new point of view. MSC codes: 03B30 ..."

Abstract
- Add to MetaCart

*Infinite*

*sequences*are considered in the framework of classical logic from a new point of view. MSC codes: 03B30

###
On *Infinite* *Sequences* (almost) as Easy as

, 1994

"... . It is known that infinite binary sequences of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might suggest, there are sequences of constant, polynomial-time bounded Kolmogorov co ..."

Abstract
- Add to MetaCart

. It is known that

*infinite*binary*sequences*of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might suggest, there are*sequences*of constant, polynomial-time bounded Kolmogorov###
*Infinite* *Sequences* and Pattern Avoidance

, 2004

"... The study of combinatorics on words dates back at least to the beginning of the 20 century and the work of Axel Thue. Thue was the first to give an example of an infinite word over a three letter alphabet that contains no squares (identical adjacent blocks) xx. This result was eventually used to so ..."

Abstract
- Add to MetaCart

The study of combinatorics on words dates back at least to the beginning of the 20 century and the work of Axel Thue. Thue was the first to give an example of an

*infinite*word over a three letter alphabet that contains no squares (identical adjacent blocks) xx. This result was eventually used