Results for 'Complex number notation of time'

977 found
Order:
  1. A Complex Number Notation of Nature of Time: An Ancient Indian Insight.R. B. Varanasi Varanasi Varanasi Ramabrahmam, Ramabrahmam Varanasi, V. Ramabrahmam - 2013 - In Varanasi Ramabrahmam Ramabrahmam Varanasi V. Ramabrahmam R. B. Varanasi Varanasi (ed.), Proceedings of 5th International Conference on Vedic Sciences on “Applications and Challenges in Vedic / Ancient Indian Mathematics". Veda Vijnaana Sudha. pp. 386-399.
    The nature of time is perceived by intellectuals variedly. An attempt is made in this paper to reconcile such varied views in the light of the Upanishads and related Indian spiritual and philosophical texts. The complex analysis of modern mathematics is used to represent the nature and presentation physical and psychological times so differentiated. Also the relation between time and energy is probed using uncertainty relations, forms of energy and phases of matter.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2. The Physics of Timelessness.Varanasi Ramabrahmam - 2018 - Cosmos and History 14 (2):74-115.
    The nature of time is yet to be fully grasped and finally agreed upon among physicists, philosophers, psychologists and scholars from various disciplines. Present paper takes clue from the known assumptions of time as - movement, change, becoming - and the nature of time will be thoroughly discussed. -/- The real and unreal existences of time will be pointed out and presented. The complex number notation of nature of time will be put (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  3.  15
    Foundations of algorithms.Richard E. Neapolitan - 2015 - Burlington, MA: Jones & Bartlett Learning.
    Foundations of Algorithms, Fifth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. Ideal for any computer science students with a background in college algebra and discrete structures, the text presents mathematical concepts using standard English and simple notation to maximize accessibility and user-friendliness. Concrete examples, appendices reviewing essential mathematical concepts, and a student-focused approach reinforce theoretical explanations and promote learning and retention. C++ and Java pseudocode help students better understand complex algorithms. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  4. Parsimony hierarchies for inductive inference.Andris Ambainis, John Case, Sanjay Jain & Mandayam Suraj - 2004 - Journal of Symbolic Logic 69 (1):287-327.
    Freivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and "nearly" minimal size, i.e., within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. A lim-computablefunction is (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its output. (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5. Architecture and Deconstruction. The Case of Peter Eisenman and Bernard Tschumi.Cezary Wąs - 2015 - Dissertation, University of Wrocław
    Architecture and Deconstruction Case of Peter Eisenman and Bernard Tschumi -/- Introduction Towards deconstruction in architecture Intensive relations between philosophical deconstruction and architecture, which were present in the late 1980s and early 1990s, belong to the past and therefore may be described from a greater than before distance. Within these relations three basic variations can be distinguished: the first one, in which philosophy of deconstruction deals with architectural terms but does not interfere with real architecture, the second one, in which (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  6.  19
    Healthcare is Demanding: Patience is a Virtue!Andrea Torrence - 2023 - Narrative Inquiry in Bioethics 13 (1):11-13.
    In lieu of an abstract, here is a brief excerpt of the content:Healthcare is Demanding:Patience is a Virtue!Andrea TorrenceNursing is a rewarding career, but it can also be extremely challenging, depending on the type of patient you are assigned to. In my career, I have had a number of "difficult" patients, and every situation required a specific type of approach. Understanding how to interact with a difficult patient is a talent and requires a level of patience that exceeds the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7. Deleuze's Third Synthesis of Time.Daniela Voss - 2013 - Deleuze and Guatarri Studies 7 (2):194-216.
    Deleuze's theory of time set out in Difference and Repetition is a complex structure of three different syntheses of time – the passive synthesis of the living present, the passive synthesis of the pure past and the static synthesis of the future. This article focuses on Deleuze's third synthesis of time, which seems to be the most obscure part of his tripartite theory, as Deleuze mixes different theoretical concepts drawn from philosophy, Greek drama theory and mathematics. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  8. Decision Making Based on Valued Fuzzy Superhypergraphs.Florentin Smarandache - 2023 - Computer Modeling in Engineering and Sciences 138 (2):1907-1923.
    This paper explores the defects in fuzzy (hyper) graphs (as complex (hyper) networks) and extends the fuzzy (hyper) graphs to fuzzy (quasi) superhypergraphs as a new concept.We have modeled the fuzzy superhypergraphs as complex superhypernetworks in order to make a relation between labeled objects in the form of details and generalities. Indeed, the structure of fuzzy (quasi) superhypergraphs collects groups of labeled objects and analyzes them in the form of the part to part of objects, the part of (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  9.  15
    The Risk Priority Number Evaluation of FMEA Analysis Based on Random Uncertainty and Fuzzy Uncertainty.Xiaojun Wu & Jing Wu - 2021 - Complexity 2021:1-15.
    The risk priority number calculation method is one of the critical subjects of failure mode and effects analysis research. Recently, RPN research under a fuzzy uncertainty environment has become a hot topic. Accordingly, increasing studies have ignored the important impact of the random sampling uncertainty in the FMEA assessment. In this study, a fuzzy beta-binomial RPN evaluation method is proposed by integrating fuzzy theory, Bayesian statistical inference, and the beta-binomial distribution. This model can effectively realize real-time, dynamic, and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  19
    Complexity of monodic guarded fragments over linear and real time.Ian Hodkinson - 2006 - Annals of Pure and Applied Logic 138 (1):94-125.
    We show that the satisfiability problem for the monodic guarded, loosely guarded, and packed fragments of first-order temporal logic with equality is 2Exptime-complete for structures with arbitrary first-order domains, over linear time, dense linear time, rational number time, and some other classes of linear flows of time. We then show that for structures with finite first-order domains, these fragments are also 2Exptime-complete over real number time and hence over most of the commonly used (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11.  29
    Complex Pleasure: Forms of Feeling in German Literature.Stanley Corngold - 1998 - Stanford University Press.
    Complex Pleasure deals with questions of literary feeling in eight major German writers—Lessing, Kant, Hölderlin, Nietzsche, Musil, Kafka, Trakl, and Benjamin. On the basis of close readings of these authors Stanley Corngold makes vivid the following ideas: that where there is literature there is complex pleasure; that this pleasure is complex because it involves the impression of a disclosure; that this thought is foremost in the minds of a number of canonical writers; that important literary works (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  14
    The Complex Neural Network Model for Mass Appraisal and Scenario Forecasting of the Urban Real Estate Market Value That Adapts Itself to Space and Time.Leonid N. Yasnitsky, Vitaly L. Yasnitsky & Aleksander O. Alekseev - 2021 - Complexity 2021:1-17.
    In the modern scientific literature, there are many reports about the successful application of neural network technologies for solving complex applied problems, in particular, for modeling the urban real estate market. There are neural network models that can perform mass assessment of real estate objects taking into account their construction and operational characteristics. However, these models are static because they do not take into account the changing economic situation over time. Therefore, they quickly become outdated and need frequent (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14.  64
    Quantum mechanics and the direction of time.H. Hasegawa, T. Petrosky, I. Prigogine & S. Tasaki - 1991 - Foundations of Physics 21 (3):263-281.
    In recent papers the authors have discussed the dynamical properties of “large Poincaré systems” (LPS), that is, nonintegrable systems with a continuous spectrum (both classical and quantum). An interesting example of LPS is given by the Friedrichs model of field theory. As is well known, perturbation methods analytic in the coupling constant diverge because of resonant denominators. We show that this Poincaré “catastrophe” can be eliminated by a natural time ordering of the dynamical states. We obtain then a dynamical (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  24
    Analysis of the Earned Value Management and Earned Schedule Techniques in Complex Hydroelectric Power Production Projects: Cost and Time Forecast.P. Urgilés, J. Claver & M. A. Sebastián - 2019 - Complexity 2019:1-11.
    All projects take place within a context of uncertainty. That is especially noticeable in complex hydroelectric power generation projects, which are affected by factors such as the large number of multidisciplinary tasks to be performed in parallel, long execution times, or the risks inherent in various fields like geology, hydrology, and structural, electrical, and mechanical engineering, among others. Such factors often lead to cost overruns and delays in projects of this type. This paper analyzes the efficiency of the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  8
    Sailing the ocean of complexity: lessons from the physics-biology frontier.Sauro Succi - 2022 - Oxford, United Kingdom: Oxford University Press.
    "Both superb and essential... Succi, with clarity and wit, takes us from quarks and Boltzmann to soft matter - precisely the frontier of physics and life." Stuart Kauffman, MacArthur Fellow, Fellow of the Royal Society of Canada, Gold Medal Accademia Lincea We live in a world of utmost complexity, outside and within us. There are thousand of billions of billions of stars out there in the Universe, a hundred times more molecules in a glass of water, and another hundred times (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  17.  17
    On the Origins of Social Complexity in the Central Andes and Possible Linguistic Correlations.Peter Kaulicke - 2012 - In Kaulicke Peter (ed.), Archaeology and Language in the Andes. pp. 111.
    This chapter tackles a number of problems surrounding the emergence and formation of complex societies in the central Andes, principally on the north and central coasts of Peru and their adjacent highlands. While chronology itself will form part of the discussion, there is general agreement in envisaging this process as taking place over a period of some three millennia between c.3000 bc and the beginning of our era. The focus here is on the earlier part of this ‘block’ (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  43
    Bounded arithmetic for NC, ALogTIME, L and NL.P. Clote & G. Takeuti - 1992 - Annals of Pure and Applied Logic 56 (1-3):73-117.
    We define theories of bounded arithmetic, whose definable functions and relations are exactly those in certain complexity classes. Based on a recursion-theoretic characterization of NC in Clote , the first-order theory TNC, whose principal axiom scheme is a form of short induction on notation for nondeterministic polynomial-time computable relations, has the property that those functions having nondeterministic polynomial-time graph Θ such that TNC x y Θ are exactly the functions in NC, computable on a parallel random-access machine (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  19.  22
    Development of a New Multi-step Iteration Scheme for Solving Non-Linear Models with Complex Polynomiography.Amanullah Soomro, Amir Naseem, Sania Qureshi & Nasr Al Din Ide - 2022 - Complexity 2022:1-15.
    The appearance of nonlinear equations in science, engineering, economics, and medicine cannot be denied. Solving such equations requires numerical methods having higher-order convergence with cost-effectiveness, for the equations do not have exact solutions. In the pursuit of efficient numerical methods, an attempt is made to devise a modified strategy for approximating the solution of nonlinear models in either scalar or vector versions. Two numerical methods of second-and sixth-order convergence are carefully merged to obtain a hybrid multi-step numerical method with twelfth-order (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  29
    Real numbers, continued fractions and complexity classes.Salah Labhalla & Henri Lombardi - 1990 - Annals of Pure and Applied Logic 50 (1):1-28.
    We study some representations of real numbers. We compare these representations, on the one hand from the viewpoint of recursive functionals, and of complexity on the other hand.The impossibility of obtaining some functions as recursive functionals is, in general, easy. This impossibility may often be explicited in terms of complexity: - existence of a sequence of low complexity whose image is not a recursive sequence, - existence of objects of low complexity but whose images have arbitrarily high time- complexity (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  21. Review of Space, Time, and Number in the Brain. [REVIEW]Carlos Montemayor & Rasmus Grønfeldt Winther - 2015 - Mathematical Intelligencer 37 (2):93-98.
    Albert Einstein once made the following remark about "the world of our sense experiences": "the fact that it is comprehensible is a miracle." (1936, p. 351) A few decades later, another physicist, Eugene Wigner, wondered about the unreasonable effectiveness of mathematics in the natural sciences, concluding his classic article thus: "the miracle of the appropriateness of the language of mathematics for the formulation of the laws of physics is a wonderful gift which we neither understand nor deserve" (1960, p. 14). (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  22.  35
    Complexity of equivalence relations and preorders from computability theory.Egor Ianovski, Russell Miller, Keng Meng Ng & André Nies - 2014 - Journal of Symbolic Logic 79 (3):859-881.
    We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relationsR,S, a componentwise reducibility is defined byR≤S⇔ ∃f∀x, y[x R y↔fS f].Here,fis taken from a suitable class of effective functions. For us the relations will be on natural numbers, andfmust be computable. We show that there is a${\rm{\Pi }}_1^0$-complete equivalence relation, but no${\rm{\Pi }}_k^0$-complete fork≥ 2. We show that${\rm{\Sigma }}_k^0$preorders arising naturally in the above-mentioned areas are${\rm{\Sigma }}_k^0$-complete. This includes polynomial timem-reducibility on (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  23.  32
    Is Standard Music Notation Able to Picture Aristotle’s Time?Niko Strobach - 2024 - History of Philosophy & Logical Analysis 26 (2):303-320.
    It is argued that standard music notation pictures Aristotle’s time (time, as Aristotle conceived of it) in a number of important respects, which concern its micro-structure. It is then argued that this allows us to see some features of Aristotle’s time more clearly. Most importantly, Aristotelian instants can be pictured by bar-lines. This allows us to see as how radically devoid of any content Aristotelian instants should be interpreted. Thus, attention to music notation may (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  24.  18
    The dimensionality of notation.Humphrey van Polanen Petel - 2005 - Semiotica 2005 (157):187-197.
    Elements of notation are variables and sentences are sequences of different variables. Both listening and reading are processes, which makes a sentence a stream of variations of a single variable. Thus, a simple sentence is a one-dimensional object, measured along the stream of variation. A sentence with coordinated or subordinated material effectively encodes multiple streams which makes a complex sentence a two-dimensional object with that second dimension measured across the multiple streams. A single symbol does not vary and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25.  22
    Notational usage modulates attention networks in binumerates.Atesh Koul, Vaibhav Tyagi & Nandini C. Singh - 2014 - Frontiers in Human Neuroscience 8:77089.
    Multicultural environments require learning multiple number notations wherein some are encountered more frequently than others. This leads to differences in exposure and consequently differences in usage between notations. We find that differential notational usage imposes a significant neurocognitive load on number processing. Despite simultaneous acquisition, forty-two adult binumerate populations, familiar with two positional writing systems namely Hindu Nagari digits and Hindu Arabic digits, reported significantly lower preference and usage for Nagari as compared to Arabic. Twenty-four participants showed significantly (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  26.  71
    Concrete magnitudes: From numbers to time.Christine Falter, Valdas Noreika, Julian Kiverstein & Bruno Mölder - 2009 - Behavioral and Brain Sciences 32 (3-4):335-336.
    Cohen Kadosh & Walsh (CK&W) present convincing evidence indicating the existence of notation-specific numerical representations in parietal cortex. We suggest that the same conclusions can be drawn for a particular type of numerical representation: the representation of time. Notation-dependent representations need not be limited to number but may also be extended to other magnitude-related contents processed in parietal cortex (Walsh 2003).
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  27.  53
    Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time.Fengwei Li, Xiaoyan Zhang, Qingfang Ye & Yuefang Sun - 2019 - Complexity 2019:1-8.
    The scattering number and isolated scattering number of a graph have been introduced in relation to Hamiltonian properties and network vulnerability, and the isolated scattering number plays an important role in characterizing graphs with a fractional 1-factor. Here we investigate the computational complexity of one variant, namely, the weighted isolated scattering number. We give a polynomial time algorithm to compute this parameter of interval graphs, an important subclass of perfect graphs.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  50
    On the complexity of Gödel's proof predicate.Yijia Chen & Jörg Flum - 2010 - Journal of Symbolic Logic 75 (1):239-254.
    The undecidability of first-order logic implies that there is no computable bound on the length of shortest proofs of valid sentences of first-order logic. Some valid sentences can only have quite long proofs. How hard is it to prove such "hard" valid sentences? The polynomial time tractability of this problem would imply the fixed-parameter tractability of the parameterized problem that, given a natural number n in unary as input and a first-order sentence φ as parameter, asks whether φ (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  29
    Number and Numeral.Friedrich Kittler - 2006 - Theory, Culture and Society 23 (7-8):51-61.
    In his essay Thinking Colours and/or Machines Kittler hints at a key point in the emergence of modern European culture: the point at which ‘letters and numbers no longer coincide’. In this essay - first published in 2003 as Zahl und Ziffer - Kittler traces the split between numerals and numbers in sweeping historical detail. This is part of a much larger project, the aim of which is to think about technology, history and culture anew by considering the ways in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  30.  84
    The complexity of temporal logic over the reals.Mark Reynolds - 2010 - Annals of Pure and Applied Logic 161 (8):1063-1096.
    It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete. This is the most practically useful dense time temporal logic.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  31. Big-Oh Notations, Elections, and Hyperreal Numbers: A Socratic Dialogue.Samuel Alexander & Bryan Dawson - 2023 - Proceedings of the ACMS 23.
    We provide an intuitive motivation for the hyperreal numbers via electoral axioms. We do so in the form of a Socratic dialogue, in which Protagoras suggests replacing big-oh complexity classes by real numbers, and Socrates asks some troubling questions about what would happen if one tried to do that. The dialogue is followed by an appendix containing additional commentary and a more formal proof.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  32.  17
    Killing Times: The Temporal Technology of the Death Penalty.David Wills - 2019 - Fordham University Press.
    Killing Times begins with the deceptively simple observation—made by Jacques Derrida in his seminars on the topic—that the death penalty mechanically interrupts mortal time by preempting the typical mortal experience of not knowing at what precise moment we will die. Through a broader examination of what constitutes mortal temporality, David Wills proposes that the so-called machinery of death summoned by the death penalty works by exploiting, or perverting, the machinery of time that is already attached to human existence. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33.  16
    Fast Detection of Deceptive Reviews by Combining the Time Series and Machine Learning.Minjuan Zhong, Zhenjin Li, Shengzong Liu, Bo Yang, Rui Tan & Xilong Qu - 2021 - Complexity 2021:1-11.
    With the rapid growth of online product reviews, many users refer to others’ opinions before deciding to purchase any product. However, unfortunately, this fact has promoted the constant use of fake reviews, resulting in many wrong purchase decisions. The effective identification of deceptive reviews becomes a crucial yet challenging task in this research field. The existing supervised learning methods require a large number of labeled examples of deceptive and truthful opinions by domain experts, while the available unsupervised learning methods (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34. Probability and ecological complexity.Mark Colyvan - 2005 - Biology and Philosophy 20 (4):869-879.
    There is something genuinely puzzling about large-scale simplicity emerging in systems that are complex at the small scale. Consider, for example, a population of hares. Clearly, the number of hares at any given time depends on hare fertility rates, the weather, the number of predators, the health of the predators, availability of hare resources, motor vehicle traffic, individual hare locations, colour of individual hares, and so on. Indeed, given the incredibly complexity of the hares’ environment at (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  35.  20
    Computational complexity on computable metric spaces.Klaus Weirauch - 2003 - Mathematical Logic Quarterly 49 (1):3-21.
    We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a generally infinite family of numbers looks straightforward, at first glance, examples for which this maximum exists seem to be very rare. It is the main purpose of this paper to prove that, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  36.  25
    Complexity of finite-variable fragments of EXPTIME-complete logics ★.Mikhail Rybakov - 2007 - Journal of Applied Non-Classical Logics 17 (3):359-382.
    The main result of the present paper is that the variable-free fragment of logic K*, the logic with a single K-style modality and its “reflexive and transitive closure,” is EXPTIMEcomplete. It is then shown that this immediately gives EXPTIME-completeness of variable-free fragments of a number of known EXPTIME-complete logics. Our proof contains a general idea of how to construct a polynomial-time reduction of a propositional logic to its n-variable—and even, in the cases of K*, PDL, CTL, ATL, and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37.  61
    Evolution of adrenal and sex steroid action in vertebrates: a ligand‐based mechanism for complexity.Michael E. Baker - 2003 - Bioessays 25 (4):396-400.
    Various explanations have been proposed to account for complex differentiation and development in humans, despite the human genome containing only two to three times the number of genes in invertebrates. Ignored are the actions of adrenal and sex steroids—androgens, estrogens, glucocorticoids, mineralocorticoids, and progestins—which act through receptors that arose from an ancestral nuclear receptor in a protochordate. This ligand‐based mechanism is unique to vertebrates and was integrated into the already robust network of transcription factors in invertebrates. Adrenal and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38. Identifying with Numbers: A Philosophical and Psychoanalytical Reading of Self-Identification.Maia Nichols - 2017 - Studia Universitatis Babeş-Bolyai Philosophia:35-48.
    The need to identify, name, count and categorize predates the rise of technology. With the wearable device, our relationship to numbers is far more complex: data flows back and forth amongst devices, consumers, companies, institutions, and networks. One might purchase a self‐monitoring device for self-control or self‐enhancing under the allure of the ability to self‐manage. On the other hand, for self-care, to be the doctor of one’s own ailments. Nonetheless, measurements associated with insights on the self do not end (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39.  15
    Identification of Self-Organized Critical State on Twitter Based on the Retweets’ Time Series Analysis.Andrey Dmitriev & Victor Dmitriev - 2021 - Complexity 2021:1-12.
    There is a number of studies, in which it is established that the observed flows of microposts generated by microblogging social networks are characterized by avalanche-like behavior. Time series of microposts depicting such streams are the time series with a power-law distribution, with 1/f noise and long memory. Despite this, there are no studies devoted to the detection and analysis of self-organized critical state, subcritical phase, and supercritical phase. The presented paper is devoted to the detection and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  25
    Networking of Smart Meters Based on Time-Varying Feature of Low-Voltage Power Line Channel in Microgrid.Ya-Xin Huang, Xiao-Di Zhang, Fei Yu, Yong-Qing Wei & Hai-Long Zhang - 2021 - Complexity 2021:1-16.
    In order to manage the electricity consumption information of microgrid users, the reliability of electricity information collection is studied in this paper. The normal communication between the acquisition terminal and the smart meter is a key factor affecting the accurate collection of power information; it is the basis for ensuring the operation of the microgrid as well. In order to improve the reliability of the low power line communication between the acquisition terminal and smart meters, this article first uses the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  41.  19
    Bohmian Trajectories for Kerr–Newman Particles in Complex Space-Time.Mark Davidson - 2018 - Foundations of Physics 48 (11):1590-1616.
    Complexified Liénard–Wiechert potentials simplify the mathematics of Kerr–Newman particles. Here we constrain them by fiat to move along Bohmian trajectories to see if anything interesting occurs, as their equations of motion are not known. A covariant theory due to Stueckelberg is used. This paper deviates from the traditional Bohmian interpretation of quantum mechanics since the electromagnetic interactions of Kerr–Newman particles are dictated by general relativity. A Gaussian wave function is used to produce the Bohmian trajectories, which are found to be (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42. Genetic susceptibility to a complex disease: the key role of functional redundancy.Gaëlle Debret, Camille Jung, Jean-Pierre Hugot, Leigh Pascoe, Jean-Marc Victor & Annick Lesne - 2011 - History and Philosophy of the Life Sciences 33 (4).
    Complex diseases involve both a genetic component and a response to environmental factors or lifestyle changes. Recently, genome-wide association studies (GWAS) have succeeded in identifying hundreds of polymorphisms that are statistically associated with complex diseases. However, the association is usually weak and none of the associated allelic forms is either necessary or sufficient for the disease occurrence. We argue that this promotes a network view, centred on functional redundancy. We adapted reliability theory to the concerned sub-network, modelled as (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  43.  94
    Robust Exponential Stability of Switched Complex-Valued Neural Networks with Interval Parameter Uncertainties and Impulses.Xiaohui Xu, Huanbin Xue, Yiqiang Peng, Quan Xu & Jibin Yang - 2018 - Complexity 2018:1-12.
    In this paper, dynamic behavior analysis has been discussed for a class of switched complex-valued neural networks with interval parameter uncertainties and impulse disturbance. Sufficient conditions for guaranteeing the existence, uniqueness, and global robust exponential stability of the equilibrium point have been obtained by using the homomorphism mapping theorem, the scalar Lyapunov function method, the average dwell time method, and M-matrix theory. Since there is no result concerning the stability problem of switched neural networks defined in complex (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  44.  54
    Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..
    Volume II of Classical Recursion Theory describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, ranging from small (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   73 citations  
  45.  63
    Infinite time extensions of Kleene’s $${\mathcal{O}}$$.Ansten Mørch Klev - 2009 - Archive for Mathematical Logic 48 (7):691-703.
    Using infinite time Turing machines we define two successive extensions of Kleene’s ${\mathcal{O}}$ and characterize both their height and their complexity. Specifically, we first prove that the one extension—which we will call ${\mathcal{O}^{+}}$ —has height equal to the supremum of the writable ordinals, and that the other extension—which we will call ${\mathcal{O}}^{++}$ —has height equal to the supremum of the eventually writable ordinals. Next we prove that ${\mathcal{O}^+}$ is Turing computably isomorphic to the halting problem of infinite time (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  37
    On the nature and origin of complexity in discrete, homogeneous, locally-interacting systems.Charles H. Bennett - 1986 - Foundations of Physics 16 (6):585-592.
    The observed complexity of nature is often attributed to an intrinsic propensity of matter to self-organize under certain (e.g., dissipative) conditions. In order better to understand and test this vague thesis, we define complexity as “logical depth,” a notion based on algorithmic information and computational time complexity. Informally, logical depth is the number of steps in the deductive or causal path connecting a thing with its plausible origin. We then assess the effects of dissipation, noise, and spatial and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  47.  91
    Cognitive complexity of suppositional reasoning: An application of the relational complexity metric to the Knight-knave task.Damian P. Birney & Graeme S. Halford - 2002 - Thinking and Reasoning 8 (2):109 – 134.
    An application of the Method of Analysis of Relational Complexity (MARC) to suppositional reasoning in the knight-knave task is outlined. The task requires testing suppositions derived from statements made by individuals who either always tell the truth or always lie. Relational complexity (RC) is defined as the number of unique entities that need to be processed in parallel to arrive at a solution. A selection of five ternary and five quaternary items were presented to 53 psychology students using a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  48.  58
    (1 other version)The semantics of “Dasein” and the modality of being and time.W. Martin - 2009 - In .
    Being and Time is a methodologically complex work, combining hermeneutic, transcendental, phenomenological, and ontological strategies in a provocative and not-obviously-stable concoction. In this article, I focus on one strand of the methodological puzzles raised by Heidegger’s undertaking: the problem of warranting the modal claims that occur frequently in the course of Heidegger’s project. In a number of crucial passages, we are told that one or another trait of Dasein is necessary, or that some ontic feature of Dasein (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  38
    Another Look at Looking Time: Surprise as Rational Statistical Inference.Zi L. Sim & Fei Xu - 2019 - Topics in Cognitive Science 11 (1):154-163.
    Surprise—operationalized as looking time—has a long history in developmental research, providing a window into the perception and cognition of infants. Recently, however, a number of developmental researchers have considered infants’ and children's surprise in its own right. This article reviews empirical evidence and computational models of complex statistical inferences underlying surprise, and discusses how these findings relate to the role that surprise appears to play as a catalyst for learning.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  50.  60
    Babbage's guidelines for the design of mathematical notations.Dirk Schlimm & Jonah Dutz - 2021 - Studies in History and Philosophy of Science Part A 1 (88):92–101.
    The design of good notation is a cause that was dear to Charles Babbage's heart throughout his career. He was convinced of the "immense power of signs" (1864, 364), both to rigorously express complex ideas and to facilitate the discovery of new ones. As a young man, he promoted the Leibnizian notation for the calculus in England, and later he developed a Mechanical Notation for designing his computational engines. In addition, he reflected on the principles that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 977