Computability of Analytic Functions with Analytic Machines (English)
- New search for: Gartner, T.
- New search for: Hotz, G.
- New search for: Gartner, T.
- New search for: Hotz, G.
- New search for: Ambos-Spies, K.
- New search for: Lowe, Benedikt
- New search for: Merkle, Wolfgang
In:
Computability in Europe; Mathematical theory and computational practice
5635
;
250-259
;
2009
-
ISBN:
-
ISSN:
- Conference paper / Print
-
Title:Computability of Analytic Functions with Analytic Machines
-
Contributors:
-
Conference:Conference; 5th, Computability in Europe; Mathematical theory and computational practice ; 2009 ; Heidelberg, Germany
-
Published in:LECTURE NOTES IN COMPUTER SCIENCE , 5635 ; 250-259
-
Publisher:
- New search for: Springer
-
Place of publication:Berlin
-
Publication date:2009-01-01
-
Size:10 pages
-
Remarks:Also known as CiE 2009. Includes bibliographical references and index.
-
ISBN:
-
ISSN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
-
Keywords:
-
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
First-Order Universality for Real ProgramsAnberree, T. et al. | 2009
- 11
-
Skolem + Tetration Is Well-OrderedBarra, M. / Gerhardy, P. et al. | 2009
- 21
-
Structures of Some Strong ReducibilitiesBelanger, D.R. et al. | 2009
- 31
-
Complexity of Existential Positive First-Order LogicBodirsky, M. / Hermann, M. / Richoux, F. et al. | 2009
- 37
-
Stochastic Programs and Hybrid Automata for (Biological) ModelingBortolussi, L. / Policriti, A. et al. | 2009
- 49
-
Numberings and RandomnessBrodhead, P. / Kjos-Hanssen, B. et al. | 2009
- 59
-
The Strength of the Gratzer-Schmidt TheoremBrodhead, P. / Kjos-Hanssen, B. et al. | 2009
- 68
-
Hyperloops Do Not Threaten the Notion of an Effective ProcedureButton, T. et al. | 2009
- 79
-
Minimum Entropy Combinatorial Optimization ProblemsCardinal, J. / Fiorini, S. / Joret, G. et al. | 2009
- 89
-
Program Self-Reference in Constructive Scott SubdomainsCase, J. / Moelius, S.E. et al. | 2009
- 99
-
Sigma ~1^0 and Pi ~1^0 Equivalence StructuresCenzer, D. / Harizanov, V. / Remmel, J.B. et al. | 2009
- 109
-
Immunity for Closed SetsCenzer, D. / Weber, R. / Wu, G. et al. | 2009
- 118
-
Lower Bounds for Kernelizations and Other Preprocessing ProceduresChen, Y. / Flum, J. / Muller, M. et al. | 2009
- 129
-
Infinite-Time Turing Machines and Borel ReducibilityCoskey, S. et al. | 2009
- 134
-
Cutting Planes and the Parameter CutwidthDantchev, S. / Martin, B. et al. | 2009
- 144
-
Members of Random Closed SetsDiamondstone, D. / Kjos-Hanssen, B. et al. | 2009
- 154
-
Lowness for Demuth RandomnessDowney, R. / Ng, K.M. et al. | 2009
- 167
-
Graph States and the Necessity of Euler DecompositionDuncan, R. / Perdrix, S. et al. | 2009
- 178
-
On Stateless Multicounter MachinesEgecioglu, O. / Ibarra, O.H. et al. | 2009
- 188
-
Computability of Continuous Solutions of Higher-Type EquationsEscardo, M. et al. | 2009
- 198
-
Equivalence Relations on Classes of Computable StructuresFokina, E.B. / Friedman, S.-D. et al. | 2009
- 208
-
Fractals Generated by Algorithmically Random Brownian MotionFouche, W.L. et al. | 2009
- 218
-
Computable Exchangeable Sequences Have Computable de Finetti MeasuresFreer, C.E. / Roy, D.M. et al. | 2009
- 232
-
Spectra of Algebraic Fields and SubfieldsFrolov, A. / Kalimullin, I. / Miller, R. et al. | 2009
- 242
-
Definability in the Local Theory of the omega -Enumeration DegreesGanchev, H. et al. | 2009
- 250
-
Computability of Analytic Functions with Analytic MachinesGartner, T. / Hotz, G. et al. | 2009
- 260
-
An Application of Martin-Lof Randomness to Effective Probability TheoryHoyrup, M. / Rojas, C. et al. | 2009
- 270
-
Index Sets and Universal NumberingsJain, S. / Stephan, F. / Teutsch, J. et al. | 2009
- 280
-
Ordinal ComputabilityKoepke, P. et al. | 2009
- 290
-
A Gandy Theorem for Abstract Structures and Applications to First-Order DefinabilityKudinov, O.V. / Selivanov, V.L. et al. | 2009
- 300
-
Constructing New Aperiodic Self-simulating Tile SetsLafitte, G. / Weiss, M. et al. | 2009
- 310
-
Relationship between Kanamori-McAloon Principle and Paris-Harrington TheoremLee, G. et al. | 2009
- 324
-
The First Order Theories of the Medvedev and Muchnik LatticesLewis, A. / Nies, A. / Sorbi, A. et al. | 2009
- 332
-
Infima of d.r.e. DegreesLiu, J. / Wang, S. / Wu, G. et al. | 2009
- 342
-
A Divergence Formula for Randomness and DimensionLutz, J.H. et al. | 2009
- 352
-
On Ladner's Result for a Class of Real Machines with Restricted Use of ConstantsMeer, K. et al. | 2009
- 362
-
0"-Categorical Completely Decomposable Torsion-Free Abelian GroupsMelnikov, A.G. et al. | 2009
- 372
-
Notes on the Jump of a StructureMontalban, A. et al. | 2009
- 379
-
A General Representation Theorem for Probability Functions Satisfying Spectrum ExchangeabilityParis, J.B. / Vencovska, A. et al. | 2009
- 389
-
Stability under Strategy SwitchingPaul, S. / Ramanujam, R. / Simon, S. et al. | 2009
- 399
-
Computational Heuristics for Simplifying a Biological ModelPetre, I. / Mizera, A. / Back, R.-J. et al. | 2009
- 409
-
Functions Definable by Arithmetic CircuitsPratt-Hartmann, I. / Duntsch, I. et al. | 2009
- 419
-
Survey on Oblivious Routing StrategiesRacke, H. et al. | 2009
- 430
-
An Approach to the Engineering of Cellular Models Based on P SystemsRomero-Campero, F.J. / Krasnogor, N. et al. | 2009
- 437
-
Decidability of Sub-theories of Polynomials over a Finite FieldSirokofskich, A. et al. | 2009
- 447
-
Chaitin Omega Numbers and Halting ProblemsTadaki, K. et al. | 2009
- 457
-
Bayesian Data Integration and Enrichment Analysis for Predicting Gene Function in MalariaTedder, P.M.R. / Bradford, J.R. / Needham, C.J. / McConkey, G.A. / Bulpitt, A.J. / Westhead, D.R. et al. | 2009
- 467
-
Dialectica Interpretation with Fine Computational ControlTrifonov, T. et al. | 2009
- 478
-
Algorithmic Minimal Sufficient Statistic RevisitedVereshchagin, N. et al. | 2009
- 488
-
A Computation of the Maximal Order Type of the Term Ordering on Finite MultisetsWeiermann, A. et al. | 2009
- 499
-
On Generating Independent Random StringsZimand, M. et al. | 2009