computable sequence
Recently Published Documents


TOTAL DOCUMENTS

4
(FIVE YEARS 0)

H-INDEX

1
(FIVE YEARS 0)

Author(s):  
John Stillwell

This chapter develops the basic results of computability theory, many of which are about noncomputable sequences and sets, with the goal of revealing the limits of computable analysis. Two of the key examples are a bounded computable sequence of rational numbers whose limit is not computable, and a computable tree with no computable infinite path. Computability is an unusual mathematical concept, because it is most easily used in an informal way. One often talks about it in terms of human activities, such as making lists, rather than by applying a precise definition. Nevertheless, there is a precise definition of computability, so this informal description of computations can be formalized.


Author(s):  
John Stillwell

This chapter develops the basic results of computability theory, many of which are about noncomputable sequences and sets, with the goal of revealing the limits of computable analysis. Two of the key examples are a bounded computable sequence of rational numbers whose limit is not computable, and a computable tree with no computable infinite path. Computability is an unusual mathematical concept, because it is most easily used in an informal way. One often talks about it in terms of human activities, such as making lists, rather than by applying a precise definition. Nevertheless, there is a precise definition of computability, so this informal description of computations can be formalized.


Author(s):  
John Stillwell

This chapter develops the basic results of computability theory, many of which are about noncomputable sequences and sets, with the goal of revealing the limits of computable analysis. Two of the key examples are a bounded computable sequence of rational numbers whose limit is not computable, and a computable tree with no computable infinite path. Computability is an unusual mathematical concept, because it is most easily used in an informal way. One often talks about it in terms of human activities, such as making lists, rather than by applying a precise definition. Nevertheless, there is a precise definition of computability, so this informal description of computations can be formalized.


2009 ◽  
Vol 15 (3) ◽  
pp. 300-319 ◽  
Author(s):  
Bart Kastermans

AbstractA cofinitary group is a subgroup of Sym(ℕ) where all nonidentity elements have finitely many fixed points. A maximal cofinitary group is a cofinitary group, maximal with respect to inclusion. We show that a maximal cofinitary group cannot have infinitely many orbits. We also show, using Martin's Axiom, that no further restrictions on the number of orbits can be obtained. We show that Martin's Axiom implies there exist locally finite maximal cofinitary groups. Finally we show that there exists a uniformly computable sequence of permutations generating a cofinitary group whose isomorphism type is not computable.


Sign in / Sign up

Export Citation Format

Share Document