Search Results

287 articles with title/keywords/abstract containing computability

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
modify search
Display per page 

K-Triviality of Closed Sets and Continuous Functions

Authors: Barmpalias, George; Cenzer, Douglas; Remmel, Jeffrey B.; Weber, Rebecca

Source: Journal of Logic and Computation, Volume 19, Number 1, 20 February 2009 , pp. 3-16(14)

Publisher: Oxford University Press

RZ: a Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice

Authors: Bauer, Andrej; Stone, Christopher A.

Source: Journal of Logic and Computation, Volume 19, Number 1, 20 February 2009 , pp. 17-43(27)

Publisher: Oxford University Press

Borel Complexity of Topological Operations on Computable Metric Spaces

Authors: Brattka, Vasco; Gherardi, Guido

Source: Journal of Logic and Computation, Volume 19, Number 1, 20 February 2009 , pp. 45-76(32)

Publisher: Oxford University Press

Pseudojumps and Π10 Classes

Authors: Cenzer, Douglas; Laforte, Geoffrey; Wu, Guohua

Source: Journal of Logic and Computation, Volume 19, Number 1, 20 February 2009 , pp. 77-87(11)

Publisher: Oxford University Press

The Settling Time Reducibility Ordering and Δ02 Sets

Author: Csima, Barbara F.

Source: Journal of Logic and Computation, Volume 19, Number 1, 20 February 2009 , pp. 145-150(6)

Publisher: Oxford University Press

The Uniformity Principle for Σ-definability

Authors: Korovina, Margarita; Kudinov, Oleg

Source: Journal of Logic and Computation, Volume 19, Number 1, 20 February 2009 , pp. 159-174(16)

Publisher: Oxford University Press

Full Text

Author: Nies, André

Source: Computability and Randomness, January 2009 , pp. i-434(435)

Publisher: Oxford Scholarship Online Monographs

4. Diagonally noncomputable functions

Author: Nies, André

Source: Computability and Randomness, January 2009 , pp. 144-163(20)

Publisher: Oxford Scholarship Online Monographs

6. Some advanced computability theory

Author: Nies, André

Source: Computability and Randomness, January 2009 , pp. 238-259(22)

Publisher: Oxford Scholarship Online Monographs

9. Higher computability and randomness

Author: Nies, André

Source: Computability and Randomness, January 2009 , pp. 365-434(70)

Publisher: Oxford Scholarship Online Monographs

Economic theory and the Alternative Set Theory AFA+AD+DC

Author: Tohmé, Fernando

Source: Logic Journal of the IGPL, Volume 17, Number 2, 12 April 2009 , pp. 179-203(25)

Publisher: Oxford University Press

On degree-preserving homeomorphisms between trees in computable topology

Authors: Kalantari, Iraj; Welch, Larry

Source: Archive for Mathematical Logic, Volume 46, Numbers 7-8, May 2008 , pp. 679-693(15)

Publisher: Springer

Borel complexity and computability of the Hahn-Banach Theorem

Author: Brattka, Vasco

Source: Archive for Mathematical Logic, Volume 46, Numbers 7-8, May 2008 , pp. 547-564(18)

Publisher: Springer

Algorithmic randomness of continuous functions

Authors: Barmpalias, George; Brodhead, Paul; Cenzer, Douglas; Remmel, Jeffrey; Weber, Rebecca

Source: Archive for Mathematical Logic, Volume 46, Numbers 7-8, May 2008 , pp. 533-546(14)

Publisher: Springer

From a Dynamical to a Semiotic Account of Emergence:

Author: Andrade

Source: Cybernetics & Human Knowing, Volume 15, Numbers 3-4, 2008 , pp. 87-96(10)

Publisher: Imprint Academic

Free Content Quantum Randomness and Value Indefiniteness

Authors: Calude, Cristian S.; Svozil, Karl

Source: Advanced Science Letters, Volume 1, Number 2, December 2008 , pp. 165-168(4)

Publisher: American Scientific Publishers

Cirquent Calculus Deepened

Author: Japaridze, Giorgi

Source: Journal of Logic and Computation, Volume 18, Number 6, 27 December 2008 , pp. 983-1028(46)

Publisher: Oxford University Press

The Polynomial Method for Random Matrices

Authors: Rao, N.; Edelman, Alan

Source: Foundations of Computational Mathematics, Volume 8, Number 6, December 2008 , pp. 649-702(54)

Publisher: Springer

Register computations on ordinals

Authors: Koepke, Peter; Siders, Ryan

Source: Archive for Mathematical Logic, Volume 47, Number 6, September 2008 , pp. 529-548(20)

Publisher: Springer

modify search
Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A