Search Results

19 articles with title/keywords/abstract containing hypercomputation

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

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

Real Hypercomputation and Continuity

Author: Ziegler, Martin

Source: Theory of Computing Systems, Volume 41, Number 1, July 2007 , pp. 177-206(30)

Publisher: Springer

Comparing Computational Power

Authors: Boker, Udi; Dershowitz, Nachum

Source: Logic Journal of the IGPL, Volume 14, Number 5, October 2006 , pp. 633-647(15)

Publisher: Oxford University Press

Computational Power of Infinite Quantum Parallelism

Author: Ziegler, Martin

Source: International Journal of Theoretical Physics, Volume 44, Number 11, November 2005 , pp. 2059-2071(13)

Publisher: Springer

The Diagonal Method and Hypercomputation

Authors: Ord, Toby; Kieu, Tien D.

Source: British Journal for the Philosophy of Science, Volume 56, Number 1, March 2005 , pp. 147-156(10)

Publisher: Oxford University Press

On the Possibility, or Otherwise, of Hypercomputation

Author: P. D. Welch

Source: British Journal for the Philosophy of Science, Volume 55, Number 4, December 2004 , pp. 739-746(8)

Publisher: Oxford University Press

Quantum Algorithm for Hilbert's Tenth Problem

Author: Kieu T.D.

Source: International Journal of Theoretical Physics, Volume 42, Number 7, July 2003 , pp. 1461-1478(18)

Publisher: Springer

Hypercomputation and the Physical Church-Turing Thesis

Author: Cotogno P.

Source: British Journal for the Philosophy of Science, Volume 54, Number 2, June 2003 , pp. 181-223(43)

Publisher: Oxford University Press

Transcending Turing Computability

Author: Maclennan B.J.

Source: Minds and Machines, Volume 13, Number 1, February 2003 , pp. 3-22(20)

Publisher: Springer

Computation and Hypercomputation

Author: Stannett M.

Source: Minds and Machines, Volume 13, Number 1, February 2003 , pp. 115-153(39)

Publisher: Springer

Physical Hypercomputation and the Church–Turing Thesis

Authors: Shagrir O.; Pitowsky I.

Source: Minds and Machines, Volume 13, Number 1, February 2003 , pp. 87-101(15)

Publisher: Springer

Comments on `Two Undecidable Problems of Analysis'

Author: Scarpellini B.

Source: Minds and Machines, Volume 13, Number 1, February 2003 , pp. 79-85(7)

Publisher: Springer

Computing Machines Can't Be Intelligent (...and Turing Said So)

Author: Kugel P.

Source: Minds and Machines, Volume 12, Number 4, November 2002 , pp. 563-579(17)

Publisher: Springer

Quantum Hypercomputation

Author: Kieu T.D.

Source: Minds and Machines, Volume 12, Number 4, November 2002 , pp. 541-561(21)

Publisher: Springer

Hypercomputation

Author: Copeland B.J.

Source: Minds and Machines, Volume 12, Number 4, November 2002 , pp. 461-502(42)

Publisher: Springer

On Effective Procedures

Author: Cleland C.E.

Source: Minds and Machines, Volume 12, Number 2, May 2002 , pp. 159-179(21)

Publisher: Springer

Toward a Formal Philosophy of Hypercomputation

Authors: Bringsjord S.; Zenzen M.

Source: Minds and Machines, Volume 12, Number 2, May 2002 , pp. 241-258(18)

Publisher: Springer

Accelerating Turing Machines

Author: Copeland B.J.

Source: Minds and Machines, Volume 12, Number 2, May 2002 , pp. 281-300(20)

Publisher: Springer

What Turing Did after He Invented the Universal Turing Machine

Authors: Copeland B.J.; Proudfoot D.

Source: Journal of Logic, Language and Information, Volume 9, Number 4, October 2000 , pp. 491-509(19)

Publisher: Springer

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