Decision Times of Infinite Computations

, &
Notre Dame Journal of Formal Logic 63 (2) (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1215/00294527-2022-0012

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Infinite Computations with Random Oracles.Merlin Carl & Philipp Schlicht - 2017 - Notre Dame Journal of Formal Logic 58 (2):249-270.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Random reals and possibly infinite computations Part I: Randomness in ∅'.Verónica Becher & Serge Grigorieff - 2005 - Journal of Symbolic Logic 70 (3):891-913.
Numerical computations and mathematical modelling with infinite and infinitesimal numbers.Yaroslav Sergeyev - 2009 - Journal of Applied Mathematics and Computing 29:177-195.
The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area.Yaroslav Sergeyev - 2016 - Communications in Nonlinear Science and Numerical Simulation 31 (1-3):21–29.
From index sets to randomness in ∅ n : random reals and possibly infinite computations. Part II.Verónica Becher & Serge Grigorieff - 2009 - Journal of Symbolic Logic 74 (1):124-156.
A new applied approach for executing computations with infinite and infinitesimal quantities.Yaroslav D. Sergeyev - 2008 - Informatica 19 (4):567-596.
O różnych sposobach rozumienia analogowości w informatyce.Paweł Stacewicz - 2017 - Semina Scientiarum 16:94-115.
The basic theory of infinite time register machines.Merlin Carl, Tim Fischbach, Peter Koepke, Russell Miller, Miriam Nasfi & Gregor Weckbecker - 2010 - Archive for Mathematical Logic 49 (2):249-273.
Why the Infinite Decision Puzzle is Puzzling.Jeffrey A. Barrett & Frank Arntzenius - 2002 - Theory and Decision 52 (2):139-147.
Program Size Complexity for Possibly Infinite Computations.Verónica Becher, Santiago Figueira, André Nies & Silvana Picchi - 2005 - Notre Dame Journal of Formal Logic 46 (1):51-64.
A Flawed Infinite Decision Puzzle.Myron L. Pulier - 2000 - Theory and Decision 49 (3):289-290.
The infinite regress of optimization.Philippe Mongin - 1991 - Behavioral and Brain Sciences 14 (2):229-230.
Recognizable sets and Woodin cardinals: computation beyond the constructible universe.Merlin Carl, Philipp Schlicht & Philip Welch - 2018 - Annals of Pure and Applied Logic 169 (4):312-332.
Barrett and Arntzenius's Infinite Decision Puzzle.Mark J. Machina - 2000 - Theory and Decision 49 (3):291-295.

Analytics

Added to PP
2022-06-10

Downloads
17 (#846,424)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Π11 Borel sets.Alexander S. Kechris, David Marker & Ramez L. Sami - 1989 - Journal of Symbolic Logic 54 (3):915 - 920.

View all 6 references / Add more references