The following pages link to (Q4805392):
Displaying 23 items.
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- Ideal negative conceivability and the halting problem (Q485625) (← links)
- Abstract geometrical computation. III: Black holes for classical and analog computing (Q734212) (← links)
- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines (Q1434368) (← links)
- Super-tasks, accelerating Turing machines and uncomputability (Q1434371) (← links)
- Supertasks do not increase computational power (Q1761709) (← links)
- The basic theory of infinite time register machines (Q2267751) (← links)
- Weaker variants of infinite time Turing machines (Q2309496) (← links)
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems (Q2383594) (← links)
- Physical constraints on hypercomputation (Q2482458) (← links)
- The case for hypercomputation (Q2497872) (← links)
- The many forms of hypercomputation (Q2497883) (← links)
- Infinite time Turing machines with only one tape (Q2720332) (← links)
- Revision sequences and computers with an infinite amount of time (Q2720396) (← links)
- A Survey of Infinite Time Turing Machines (Q3608469) (← links)
- Is P = PSPACE for Infinite Time Turing Machines? (Q3644798) (← links)
- Building Infinite Machines (Q4483956) (← links)
- Infinite time Turing machines (Q4508248) (← links)
- (Q4530726) (← links)
- The Significance of Relativistic Computation for the Philosophy of Mathematics (Q5015969) (← links)
- Accelerating machines: a review (Q5451177) (← links)
- Book review of: A. Cevik, Philosophy of mathematics. Classic and contemporary studies (Q6169829) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
