The following pages link to Jerzy Mycka (Q706789):
Displaying 27 items.
- Real recursive functions and their hierarchy (Q706790) (← links)
- Computability on reals, infinite limits and differential equations (Q990444) (← links)
- A new conceptual framework for analog computation (Q1022610) (← links)
- A foundation for real recursive function theory (Q1032628) (← links)
- Definable properties of the computably enumerable sets (Q1295410) (← links)
- \(\mu\)-recursion and infinite limits. (Q1401321) (← links)
- Hypercomputation by definition (Q1434375) (← links)
- Turing machines associated with the undecidability property of the halting problem (Q1810121) (← links)
- Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines (Q1818780) (← links)
- Non-uniformity and generalised Sacks splitting (Q1862888) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- The P\(\neq\) NP conjecture in the context of real and complex analysis (Q2489146) (← links)
- Analog computation beyond the Turing limit (Q2497879) (← links)
- (Q2769188) (← links)
- (Q2769247) (← links)
- Undecidability over Continuous Time (Q3424115) (← links)
- (Q3632246) (← links)
- (Q4358481) (← links)
- (Q4383729) (← links)
- (Q4439455) (← links)
- (Q4890167) (← links)
- The New Promise of Analog Computation (Q5425320) (← links)
- The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem (Q5429222) (← links)
- (Q5472858) (← links)
- (Q5493754) (← links)
- RECURSIVELY ENUMERABLE SETS AND WELL-ORDERING OF THEIR ENUMERATIONS (Q5499651) (← links)
- Machines, Computations, and Universality (Q5710875) (← links)
