Results for 'complexity theory of real functions'

970 found
Order:
  1.  25
    (1 other version)Ko Ker-I. Complexity theory of real functions. Progress in theoretical computeer science. Birkhäuser, Boston, Basel, and Berlin, 1991, viii + 309 pp. [REVIEW]G. Malajovich - 1992 - Journal of Symbolic Logic 57 (4):1489-1491.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  2.  77
    J. C. Shepherdson. Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 285–308. - J. C. Shepherdson. Computational complexity of real functions. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 309–315. - A. J. Kfoury. The pebble game and logics of programs. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, an. [REVIEW]J. V. Tucker - 1990 - Journal of Symbolic Logic 55 (2):876-878.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3. Model theory of analytic functions: some historical comments.Deirdre Haskell - 2012 - Bulletin of Symbolic Logic 18 (3):368-381.
    Model theorists have been studying analytic functions since the late 1970s. Highlights include the seminal work of Denef and van den Dries on the theory of the p-adics with restricted analytic functions, Wilkie's proof of o-minimality of the theory of the reals with the exponential function, and the formulation of Zilber's conjecture for the complex exponential. My goal in this talk is to survey these main developments and to reflect on today's open problems, in particular for (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  4.  24
    A Step towards a Complexity Theory for Analog Systems.K. Meer & M. Gori - 2002 - Mathematical Logic Quarterly 48 (S1):45-58.
    Recent years have seen an increasing interest in the study of continuous-time computational models. However, not so much has been done with respect to setting up a complexity theoretic framework for such models. The present paper intends to go a step into this direction. We consider problems over the real numbers which we try to relate to Lyapunov theory for dynamical systems: The global minimizers of particular energy functions are supposed to give solutions of the problem. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  5.  59
    Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
    We show that the Turing degrees are not sufficient to measure the complexity of continuous functions on [0, 1]. Computability of continuous real functions is a standard notion from computable analysis. However, no satisfactory theory of degrees of continuous functions exists. We introduce the continuous degrees and prove that they are a proper extension of the Turing degrees and a proper substructure of the enumeration degrees. Call continuous degrees which are not Turing degrees non-total. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  6.  39
    Type‐2 computability on spaces of integrable functions.Daren Kunkle - 2004 - Mathematical Logic Quarterly 50 (4):417-430.
    Using Type‐2 theory of effectivity, we define computability notions on the spaces of Lebesgue‐integrable functions on the real line that are based on two natural approaches to integrability from measure theory. We show that Fourier transform and convolution on these spaces are computable operators with respect to these representations. By means of the orthonormal basis of Hermite functions in L2, we show the existence of a linear complexity bound for the Fourier transform. (© 2004 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  43
    The theory of meaning in buddhist logicians: The historical and intellectual context of apoha. [REVIEW]R. K. Payne - 1987 - Journal of Indian Philosophy 15 (3):261-284.
    These supporting concepts enable us to much more adequately understand the meaning of apoha. First, a sharp distinction is drawn between the real and the conceptual; the real is particular, unique, momentary and the basis of perception, while the conceptual is universal, general, only supposedly objective and the basis of language. Second, the complex nature of negation discloses the kind of negation meant by apoha. Negation by implication is seen as disclosing the necessary relation between simple affirmations and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8.  24
    Computability of String Functions Over Algebraic Structures Armin Hemmerling.Armin Hemmerling - 1998 - Mathematical Logic Quarterly 44 (1):1-44.
    We present a model of computation for string functions over single-sorted, total algebraic structures and study some basic features of a general theory of computability within this framework. Our concept generalizes the Blum-Shub-Smale setting of computability over the reals and other rings. By dealing with strings of arbitrary length instead of tuples of fixed length, some suppositions of deeper results within former approaches to generalized recursion theory become superfluous. Moreover, this gives the basis for introducing computational (...) in a BSS-like manner. Relationships both to classical computability and to Friedman's concept of eds computability are established. Two kinds of nondeterminism as well as several variants of recognizability are investigated with respect to interdependencies on each other and on properties of the underlying structures. For structures of finite signatures, there are universal programs with the usual characteristics. For the general case of not necessarily finite signature, this subject will be studied in a separate, forthcoming paper. (shrink)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  37
    A Quantum Theory of Money and Value.David Orrell - 2016 - Economic Thought 5 (2):19.
    The answer to the question 'what is money?' has changed throughout history. During the Gold Standard era, money was seen as gold or silver (the theory known as bullionism). In the early 20th century, the alternative theory known as chartalism proposed that money was a token chosen by the state for payment of taxes. Today, many economists take an agnostic line, and argue that money is best defined in terms of its function, e.g. as a neutral medium of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  32
    On the complexity of the pancake problem.Fuxiang Yu - 2007 - Mathematical Logic Quarterly 53 (4):532-546.
    We study the computational complexity of finding a line that bisects simultaneously two sets in the two-dimensional plane, called the pancake problem, using the oracle Turing machine model of Ko. We also study the basic problem of bisecting a set at a given direction. Our main results are: (1) The complexity of bisecting a nice (thick) polynomial-time approximable set at a given direction can be characterized by the counting class #P. (2) The complexity of bisecting simultaneously two (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  81
    The effective theory of Borel equivalence relations.Ekaterina B. Fokina, Sy-David Friedman & Asger Törnquist - 2010 - Annals of Pure and Applied Logic 161 (7):837-850.
    The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver [20] and Harrington, Kechris and Louveau [6] show that with respect to Borel reducibility, any Borel equivalence relation strictly above equality on ω is above equality on , the power set of ω, and any Borel equivalence relation strictly above equality on the reals is above equality modulo finite on . In this article we examine the (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  12. Three concepts of decidability for general subsets of uncountable spaces.Matthew W. Parker - 2003 - Theoretical Computer Science 351 (1):2-13.
    There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  13.  30
    Real-time attention theories of hippocampal function.Nestor A. Schmajuk - 1987 - Behavioral and Brain Sciences 10 (1):130-131.
  14.  43
    Expansions of algebraically closed fields II: Functions of several variables.Ya'acov Peterzil & Sergei Starchenko - 2003 - Journal of Mathematical Logic 3 (01):1-35.
    Let ℛ be an o-minimal expansion of a real closed field R. We continue here the investigation we began in [11] of differentiability with respect to the algebraically closed field [Formula: see text]. We develop the basic theory of such K-differentiability for definable functions of several variables, proving theorems on removable singularities as well as analogues of the Weierstrass preparation and division theorems for definable functions. We consider also definably meromorphic functions and prove that every (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  19
    Novel Development to the Theory of Dombi Exponential Aggregation Operators in Neutrosophic Cubic Hesitant Fuzzy Sets: Applications to Solid Waste Disposal Site Selection.Ateeq Ur Rehman, Muhammad Gulistan, Nasreen Kausar, Sajida Kousar, Mohammed M. Al-Shamiri & Rashad Ismail - 2022 - Complexity 2022:1-16.
    The neutrosophic cubic hesitant fuzzy set can efficiently handle the complex information in a decision-making problem because it combines the advantages of the neutrosophic cubic set and the hesitant fuzzy set. The algebraic operations based on Dombi norms and co-norms are more flexible than the usual algebraic operations as they involve an operational parameter. First, this paper establishes Dombi algebraic operational laws, score functions, and similarity measures in neutrosophic cubic hesitant fuzzy sets. Then, we proposed Dombi exponential operational laws (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  31
    Ideal Reaction Types and the Reactions of Real Alloys.Jeffry L. Ramsey - 1994 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1994:149 - 159.
    Research on the oxidation of alloys supports the claim that natural scientists can and do use ideal type concepts when confronted with analytical or computational intractability. In opposition to those who collapse ideal types into 'standard' theoretical concepts, I argue ideal types possess a unique structure, function and axiology. In phenomenologically complex situations, scientists use these features to articulate experiment with theory generally and in particular to discover new boundary conditions. This conceptual articulation is achieved using models rather than (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  17. W poszukiwaniu ontologicznych podstaw prawa. Arthura Kaufmanna teoria sprawiedliwości [In Search for Ontological Foundations of Law: Arthur Kaufmann’s Theory of Justice].Marek Piechowiak - 1992 - Instytut Nauk Prawnych PAN.
    Arthur Kaufmann is one of the most prominent figures among the contemporary philosophers of law in German speaking countries. For many years he was a director of the Institute of Philosophy of Law and Computer Sciences for Law at the University in Munich. Presently, he is a retired professor of this university. Rare in the contemporary legal thought, Arthur Kaufmann's philosophy of law is one with the highest ambitions — it aspires to pinpoint the ultimate foundations of law by explicitly (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  18.  29
    Non Standard Models of the Theory of Elementary Functions of a Real Variable.Daniel Richardson - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (4):355-372.
    Direct download  
     
    Export citation  
     
    Bookmark  
  19.  25
    Complexity in organoleptic paths of motion in the genre of craft beer reviews: a comparative study of Spanish and English.David Clarke - 2019 - Dissertation, Dublin City University
    The study of how languages differ in their portrayal of motion events has received much attention since Talmy provided the first detailed account of the phenomenon. Interest has extended from real, or factive motion, to imagined or fictive motion, and from there to metaphorical motion, in which experience in one sensory domain is understood in terms of motion. Studies of metaphorical motion have, however, concentrated so far on a limited number of sensory domains, principally vision, and drawn data from (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  59
    Language at Three Timescales: The Role of Real‐Time Processes in Language Development and Evolution.Bob McMurray - 2016 - Topics in Cognitive Science 8 (2):393-407.
    Evolutionary developmental systems theory stresses that selection pressures operate on entire developmental systems rather than just genes. This study extends this approach to language evolution, arguing that selection pressure may operate on two quasi-independent timescales. First, children clearly must acquire language successfully and evolution must equip them with the tools to do so. Second, while this is developing, they must also communicate with others in the moment using partially developed knowledge. These pressures may require different solutions, and their combination (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  45
    On the Elementary Theory of Restricted Real and Imaginary Parts of Holomorphic Functions.Hassan Sfouli - 2012 - Notre Dame Journal of Formal Logic 53 (1):67-77.
    We show that the ordered field of real numbers with restricted $\mathbb{R}_{\mathscr{H}}$-definable analytic functions admits quantifier elimination if we add a function symbol $^{-1}$ for the function $x\mapsto \frac{1}{x}$ (with $0^{-1}=0$ by convention), where $\mathbb{R}_{\mathscr{H}}$ is the real field augmented by the functions in the family $\mathscr{H}$ of restricted parts (real and imaginary) of holomorphic functions which satisfies certain conditions. Further, with another condition on $\mathscr{H}$ we show that the structure ($\mathbb{R}_{\mathscr{H}}$, constants) is strongly (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  46
    Complexity of reals in inner models of set theory.Boban Velickovic & W. Hugh Woodin - 1998 - Annals of Pure and Applied Logic 92 (3):283-295.
    We consider the possible complexity of the set of reals belonging to an inner model M of set theory. We show that if this set is analytic then either 1M is countable or else all reals are in M. We also show that if an inner model contains a superperfect set of reals as a subset then it contains all reals. On the other hand, it is possible to have an inner model M whose reals are an uncountable (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  23.  84
    Opposition to the Mendelian-chromosome theory: The physiological and developmental genetics of Richard Goldschmidt.Garland E. Allen - 1974 - Journal of the History of Biology 7 (1):49-92.
    We may now ask the question: In what historical perspective should we place the work of Richard Goldschmidt? There is no doubt that in the period 1910–1950 Goldschmidt was an important and prolific figure in the history of biology in general, and of genetics in particular. His textbook on physiological genetics, published in 1938, was an amazing compendium of ideas put forward in the previous half-century about how genes influence physiology and development. His earlier studies on the genetic and geographic (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  24.  47
    Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra.Martin Ziegler - 2012 - Annals of Pure and Applied Logic 163 (8):1108-1139.
  25.  27
    Residuals of Intelligent Design in Contemporary Theories about Language Nature and Origins.Antonio Pennisi & Alessandra Falzone - 2014 - Humana Mente 7 (27).
    Some contemporary theories about the origin and the nature of language resort to concepts with no bearing on Darwinian evolutionary hypothesis or evo-devo perspective which are both based on the reconstruction of species morphological structure transformation. These theories, which evoke qualitative leap, cultural evolution, structure/function coevolution as esplicative principles for human evolution, in our opinion, result compatible in some points with the most recent Intelligent Design accounts. Attempting to substantiate itself as a scientific theory, the contemporary ID is ready (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  70
    Computational complexity of logical theories of one successor and another unary function.Pascal Michel - 2007 - Archive for Mathematical Logic 46 (2):123-148.
    The first-order logical theory Th $({\mathbb{N}},x + 1,F(x))$ is proved to be complete for the class ATIME-ALT $(2^{O(n)},O(n))$ when $F(x) = 2^{x}$ , and the same result holds for $F(x) = c^{x}, x^{c} (c \in {\mathbb{N}}, c \ge 2)$ , and F(x) = tower of x powers of two. The difficult part is the upper bound, which is obtained by using a bounded Ehrenfeucht–Fraïssé game.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  27.  38
    Approximation to measurable functions and its relation to probabilistic computation.Ker-I. Ko - 1986 - Annals of Pure and Applied Logic 30 (2):173-200.
    A theory of approximation to measurable sets and measurable functions based on the concepts of recursion theory and discrete complexity theory is developed. The approximation method uses a model of oracle Turing machines, and so the computational complexity may be defined in a natural way. This complexity measure may be viewed as a formulation of the average-case complexity of real functions—in contrast to the more restrictive worst-case complexity. The relationship (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  28.  22
    δ-Decidability over the Reals.Sicun Gao, Jeremy Avigad & Edmund M. Clarke - unknown
    Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any sentence A containing only bounded quantifiers and functions in F, and any positive rational number delta, decides either “A is true”, or “a delta-strengthening of A is false”. Moreover, if F can be computed in complexity class C, then under mild assumptions, this “delta-decision problem” for bounded Sigma k-sentences resides in Sigma k. The results stand in sharp (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29.  7
    On the prognostic and modeling functions of the social utopias of Russian cosmists.Olga Khalutornykh & Maria Maksimova - 2021 - Sotsium I Vlast 4:50-57.
    Introduction. The article is focused on analyzing the utopian direction of Russian cosmism and its influence on the Soviet cosmonautics and the development of society in the USSR. This philosophical theory was created in the period that made it possible to incorporate the applied aspects of utopia into scientific and technological progress and thereby embody a number of steps towards the outer space exploration. The authors have developed criteria and parameters for assessing the utopian component of the Russian cosmism (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  68
    Anna R. Bruss and Albert R. Meyer. On time-space classes and their relation to the theory of real addition. Theoretical computer science, vol. 11 , pp. 59–69. - Leonard Berman. The complexity of logical theories. Theoretical computer science, pp. 71–77. - Hugo Volger. Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories. Theoretical computer science, vol. 23 , pp. 333–337. [REVIEW]Charles Rackoff - 1986 - Journal of Symbolic Logic 51 (3):817-818.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  31.  60
    The theory of liouville functions.Pascal Koiran - 2003 - Journal of Symbolic Logic 68 (2):353-365.
    A Liouville function is an analytic function $H : C \rightarrow C$ with a Taylor series $\Sigma_{n=1}^\infty x^n/a_n$ such the $a_n\prime s$ form a "very fast growing" sequence of integers. In this paper we exhibit the complete first-order theory of the complex field expanded with H.
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  32. Varieties of Reasoning: Assessing Adequacy.John A. Teske - 2003 - Zygon 38 (2):441-449.
    Helmut Reich’s theory of relational and contextual reasoning is a courageous initiative for the resolution of cognitive conflicts between apparently incompatible or incommensurable views. Built upon Piagetian logico-mathematical reasoning, cognitive complexity theory, and dialectical and analogical reasoning, it includes the development of a both/and logic inclusive of binary either/or logic. Reich provides philosophic, theoretical, and even initial empirical support for the development of this form of reasoning along with a heuristic for its application. A valuable step beyond (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33. On the Kolmogorov complexity of continuous real functions.Amin Farjudian - 2013 - Annals of Pure and Applied Logic 164 (5):566-576.
    Kolmogorov complexity was originally defined for finitely-representable objects. Later, the definition was extended to real numbers based on the asymptotic behaviour of the sequence of the Kolmogorov complexities of the finitely-representable objects—such as rational numbers—used to approximate them.This idea will be taken further here by extending the definition to continuous functions over real numbers, based on the fact that every continuous real function can be represented as the limit of a sequence of finitely-representable enclosures, such (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  34.  86
    A Theory of Craft: Function and Aesthetic Expression. [REVIEW]Barry Allen - 2009 - Common Knowledge 15 (3):517-517.
    Craft work (for example, ceramics and furniture) poses a dilemma for modern thinking about beauty and the arts. Because of its beauty, craft has more than mere functionality, yet because of its functionality it cannot be fine art. What should craftmakers do? Claim their work to be fine art and forget about functionality? Or remain loyal to functionality (you can eat noodles from the finest ceramic bowl) and face extinction competing with machine-made products of industrial design? Apparently, the tendency is (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  35.  7
    Functional realism suggested from the actualization of affordances.Hirofumi Ochiai - 2024 - Foundations of Chemistry 26 (3):399-411.
    Molecular structure is one of the dispositional attributes of the molecule and counted as an example of affordances. This attribute has been systematically exploited through the development of theories and practice of organic chemistry. (Ochiai 2023, pp. 141–149) The question to be addressed in this study is whether we can legitimately claim that this type of attribute is real. To answer the question, we first clarify what is worthy of the word ‘reality’ in scientific arguments. Whitehead claims that a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36.  7
    Can a Theory of Content Rely on Selected Effect Functions? Response to Christie, Brusse, et al.Nicholas Shea - 2022 - Australasian Philosophical Review 6 (4):400-411.
    In the target article, Christie, Brusse, et al. argue that selected effect functions do not, in general, explain why a trait exists in a population and, therefore, theories of representational content should not rely on selected effect functions. This response focuses on the claim about functions-for-representation. The role of evolutionary functions in a theory of content is to pick out outcomes that have been systematically stabilized by natural selection. Correctness conditions are conditions involved in explaining (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  37.  21
    A Nonstandard Delta Function in a Predicative Theory.Peter Zahn - 1995 - Mathematical Logic Quarterly 41 (2):257-260.
    In [1] Todorov has shown by means of axiomatic set theory that there exists a nonstandard function Δ: *ℝn → * ℂ such that for all continuous functions φ: ℝn → ℂ, equation image.Here *ℝ and *ℂ are the set of the nonstandard real numbers and the set of the nonstandard complex numbers, respectively, and *φ: *ℝn → *ℂ is the nonstandard extension of φ In the present note we want to prove an analogous theorem by predicative (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  38.  43
    Handbook of computability theory.Edward R. Griffor (ed.) - 1999 - New York: Elsevier.
    The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind them and aim directly toward an exposition of advanced results. Presentations of the latter sort are in some cases restricted to a short survey (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  39.  73
    About and Around Computing Over the Reals.Solomon Feferman - unknown
    1. One theory or many? In 2004 a very interesting and readable article by Lenore Blum, entitled “Computing over the reals: Where Turing meets Newton,” appeared in the Notices of the American Mathematical Society. It explained a basic model of computation over the reals due to Blum, Michael Shub and Steve Smale (1989), subsequently exposited at length in their influential book, Complexity and Real Computation (1997), coauthored with Felipe Cucker. The ‘Turing’ in the title of Blum’s article (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  40.  8
    An Algorithm for Motion Estimation Based on the Interframe Difference Detection Function Model.Tengfei Zhang & Huijuan Kang - 2021 - Complexity 2021:1-12.
    In this paper, we simulate the estimation of motion through an interframe difference detection function model and investigate the spatial-temporal context information correlation filtering target tracking algorithm, which is complex and computationally intensive. The basic theory of spatiotemporal context information and correlation filtering is studied to construct a fast target tracking method. The different computational schemes are designed for the flow of multiframe target detection from background removal to noise reduction, to single-frame detection, and finally to multiframe detection, respectively. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  41. Hobson, E. W. - The Theory Of Functions Of A Real Variable And The Theory Of Fourier's Series. [REVIEW]G. Loria - 1929 - Scientia 23 (45):403.
    No categories
     
    Export citation  
     
    Bookmark  
  42. An analysis of the theory of functions of one real variable.Robert Jason Reed - 2000 - Inquiry: The University of Arkansas Undergraduate Research Journal 1.
     
    Export citation  
     
    Bookmark  
  43.  26
    Real and Abstract Analysis. [REVIEW]P. K. H. - 1967 - Review of Metaphysics 21 (1):159-160.
    This uncommonly fine textbook of the modern theory of functions of a real variable is particularly well-suited for mathematically mature students in the fields of philosophy and foundations of mathematics, philosophy of physics, probability theory, and statistics. Those who wish to achieve first-hand acquaintance with the quantum theory will also need to have a grasp of the material presented in this book. The first chapter presents a capsule survey of topics in abstract set theory (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  44.  36
    Complexity Theory and the Structure of Full Awakening in Religious Experience.Hee-Jong Woo - 2008 - Proceedings of the Xxii World Congress of Philosophy 6:317-331.
    Enlightened experience (i.e. awakened to the truth) is the most valuable one in most religions including Christianity and Buddhism. As well-known cases of such experience are Apocalypse St. Paul and many Grand Zen masters in Zen Buddhism, it is natural for us to believe that the enlighten is for very talented or speciallytrained ones. However, applying the complexity theory on the structure of enlightenment, based on the power law function, selforganized criticality, phase transition, and emergence, it is clear (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45.  67
    More stereotypes, please! The limits of ‘theory of mind’ and the need for further studies on the complexity of real world social interactions.Kristin Andrews - 2017 - Behavioral and Brain Sciences 40.
  46.  43
    The Internationalization of the Public-Affairs Function in U.S. Multinational Enterprises.Jean J. Boddewyn - 2007 - Business and Society 46 (2):136-173.
    Researching the organization and management of international public affairs (IPA) in the then-new multinational enterprises (MNEs) started in the 1960s. At first, IPA studies kept fairly good pace with what was known about the MNEs' nonmarket environments, their structurings, and their processes. After 1980, a disconnect developed in our knowledge of these three interrelated topics. In particular, much of more recent IPA research (a) fails to reflect the true scope, real actors, and organizational location of the IPA function; (b) (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  47.  24
    The dependence of computability on numerical notations.Ethan Brauer - 2021 - Synthese 198 (11):10485-10511.
    Which function is computed by a Turing machine will depend on how the symbols it manipulates are interpreted. Further, by invoking bizarre systems of notation it is easy to define Turing machines that compute textbook examples of uncomputable functions, such as the solution to the decision problem for first-order logic. Thus, the distinction between computable and uncomputable functions depends on the system of notation used. This raises the question: which systems of notation are the relevant ones for determining (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  48.  38
    On the Kolmogorov-Chaitin complexity for short sequences.Hector Zenil - unknown
    This is a presentation about joint work between Hector Zenil and Jean-Paul Delahaye. Zenil presents Experimental Algorithmic Theory as Algorithmic Information Theory and NKS, put together in a mixer. Algorithmic Complexity Theory defines the algorithmic complexity k(s) as the length of the shortest program that produces s. But since finding this short program is in general an undecidable question, the only way to approach k(s) is to use compression algorithms. He shows how to use the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  49. “The Limbo of Ethical Simulacra”: A Reply to Ron Greene.Dana L. Cloud, Steve Macek & James Arnt Aune - 2006 - Philosophy and Rhetoric 39 (1):72-84.
    In lieu of an abstract, here is a brief excerpt of the content:Philosophy and Rhetoric 39.1 (2006) 72-84 [Access article in PDF] "The Limbo of Ethical Simulacra": A Reply to Ron Greene Dana L. Cloud Department of Communication Studies University of Texas, Austin Steve Macek Department of Speech Communication North Central College James Arnt Aune Department of Communication Texas A&M University In two recent articles, "Another Materialist Rhetoric," and "Rhetoric and Capitalism" (1998, 2004), Ronald Walter Greene pays considerable attention to (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  50. Unified complex-dynamical theory of financial, economic, and social risks and their efficient management: Reason-based governance for sustainable development.Andrei P. Kirilyuk - 2017 - In Theory of Everything, Ultimate Reality and the End of Humanity: Extended Sustainability by the Universal Science of Complexity. Beau Bassin: LAP LAMBERT Academic Publishing. pp. 194-199.
    An extended analysis compared to observations shows that modern “globalised” world civilisation has passed through the invisible “complexity threshold”, after which usual “spontaneous”, empirically driven kind of development (“invisible hand” etc.) cannot continue any more without major destructive tendencies. A much deeper, non-simplified understanding of real interaction complexity is necessary in order to cope with such globalised world development problems. Here we introduce the universal definition, fundamental origin, and dynamic equations for a major related quantity of (systemic) (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 970