The CMI Millennium “P vs NP Problem” can be resolved e.g. if one shows at least one counterexample to the "P = NP" conjecture. A certain class of problems being such counterexamples will be formulated. This implies the rejection of the hypothesis that "P = NP" for any conditions satisfying the formulation of the problem. Thus, the solution "P is different from NP" of the problem in general is proved. The class of counterexamples can be interpreted as (...) any quantum superposition of any finite set of quantum states. The Kochen-Specker theorem is involved. Any fundamentally random choice among a finite set of alternatives belong to "NP" but not to "P". The conjecture that the set complement of "P" to "NP" can be described by that kind of choice exhaustively is formulated. (shrink)

Throughout this paper, we prove TC + CON(TC*)ͰP ≠ NP. To do that, firstly we introduce the definition of scope∗ . This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face finite number of efficient computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach to a world (...) of computation, in which our time is non-classical and fuzzy, so we have random generations, but the set of all computations (our computational world) is the same as we have in classical time (TC). The result will be P ≠ NP and P* ≠ NP*. Throughout this article, we discuss around the impact of TC* on TC. (shrink)

Here, we try to show that the method used in -/- Theory of Fuzzy Time Computation(TC * vs TC, TQC). 2023. ￿hal-04330281￿ -/- is a general method that sheds light on various types of problems. The author choose the navier stocks problem, to check the possibility of solving this problem by this method. This text is a guideline of possible proof of this problem.

This is a presentation about the impacts of Logic and Theory of Computation. It starts by some explanations about Theory of Computation and its relations with the other subjects in science. Then we have some explanations about paradoxes and some historical points. In continuation, we present some of the most important paradoxes. Forthcoming, Five subjects around the relations between Logic and Theory of computation is introduced. Finally, we present a new approach to solve P vs NP problem via Paradoxes (...) (Presentation 6/20/2022 In Persian, Online seminar of The Iranian Association for Logic (IAL) . (shrink)

The paper introduces and utilizes a few new concepts: “nonstandard Peano arithmetic”, “complementary Peano arithmetic”, “Hilbert arithmetic”. They identify the foundations of both mathematics and physics demonstrating the equivalence of the newly introduced Hilbert arithmetic and the separable complex Hilbert space of quantum mechanics in turn underlying physics and all the world. That new both mathematical and physical ground can be recognized as information complemented and generalized by quantum information. A few fundamental mathematical problems of the present such as Fermat’s (...) last theorem, four-color theorem as well as its new-formulated generalization as “four-letter theorem”, Poincaré’s conjecture, “P vs NP” are considered over again, from and within the new-founding conceptual reference frame of information, as illustrations. Simple or crucially simplifying solutions and proofs are demonstrated. The link between the consistent completeness of the system mathematics-physics on the ground of information and all the great mathematical problems of the present (rather than the enumerated ones) is suggested. (shrink)

Here, by introducing a version of “Unexpected hanging paradox” first we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system could support it. Finally, we propose a claim in Theory of Computation about the consistency of this Theory. One of the major claim is:Theory of Computation and Classical Logic leads us to a contradiction.

While I was working about some basic physical phenomena, I discovered some geometric relations that also interest mathematics. In this work, I applied the rules I have been proven to P=NP? problem over impossibility of perpendicularity in the universe. It also brings out extremely interesting results out like imaginary numbers which are known as real numbers currently. Also it seems that Euclidean Geometry is impossible. The actual geometry is Riemann Geometry and complex numbers are real.

Abstract The Theory of Computation in its existed form is based on Church –Turing Thesis. Throughout this paper, we show that the Turing computation model of this theory leads us to a contradiction. In brief, by applying a well-known paradox (Unexpected hanging paradox) we show a contradiction in the Theory when we consider the Turing model as our Computation model.

One of the possible hypotheses about time is to consider any instant of time as a fuzzy number so that two instances of time could be overlapped. Historically, some Mathematicians and Philosophers have had similar ideas. Brouwer and Husserl are two examples. This article studies the impact of this change on the Theory of Computation and Complexity Theory. In order to rebuild the Theory of Computation in a more successful and productive approach to solve some major problems in Complexity Theory, (...) the present research is done. This novel theory is called here, the fuzzy time theory of computation, TC*. Here, we show the situation of some major problems in Complexity theory and Quantum complexity theory in the new model, and how some major problems would be solved. (shrink)

There has been considerable debate in the literature as to whether work in experimental philosophy actually makes any significant contribution to philosophy. One stated view is that many X-Phi projects, notwithstanding their focus on topics relevant to philosophy, contribute little to philosophical thought. Instead, it has been claimed the contribution they make appears to be to cognitive science. In contrast to this view, here we argue that at least one approach to X-Phi makes a contribution which parallels, and also extends, (...) historically salient forms of philosophical analysis, especially contributions from Immanuel Kant, William James, Peter F. Strawson and Thomas Nagel. The framework elaborated here synthesizes philosophical theory with empirical evidence from psychology and neuroscience and applies it to three perennial philosophical problems. According to this account, the origin of these three problems can be illuminated by viewing them as arising from a tension between two distinct types of cognition, each of which is associated with anatomically independent and functionally inhibitory neural networks. If the parallel we draw, between an empirical project and historically highly influential examples of philosophical analysis, is viewed as convincing, it follows that work in the cognitive sciences can contribute directly to philosophy. Further, this conclusion holds whether the empirical details of the account are correct or not. (shrink)

Here, the author tries to build the structure of the Theory of computation based on considering time as a fuzzy concept. In fact, there are reasons to consider time as a fuzzy concept. In this article, the author doesn’t go to this side but note that Brower and Husserl views on the concept of time were similar [8]. Some reasons have been given for it in [3]. Throughout this article, the author presents the Theory of Computation with Fuzzy Time. Given (...) the classic definition of Turing Machine, the concept of Time is modified to Fuzzy time. This new term calls as Theory TC* [2] and this type of computation “Fuzzy time Computation”. We have relatively large number of fundamental unsolved problems in Complexity Theory. In the new theory, some of the major obstacles and unsolved problems have been solved [2]. It should be noted that in this article, the writer considers fuzzy number associated to instants of time as a symmetric one. The point about the symmetry is in the proof of Lemma 3, although it is generalizable. In particular, the new classes of complexity Theory, P*, NP*, BPP* in the TC* analogues to the definitions of P, NP, BPP defines as their natural alternative definition. Here, we will see P*≠ NP*, P*= BPP*. Finally, we have Theorem 4. (shrink)

Here, we try to build the structure of a Theory of computation based on considering time as a fuzzy concept. Actually, there are some reasons to consider time as a fuzzy concept. In this article, we don’t go to this side but we remind that Brower and Husserl ideas about the concept of time were similar [14]. Throughout this article, we present the Theory of Computation with Fuzzy Time. Considering the classical definition of Turing Machine we change and modify the (...) concept of Time to Fuzzy time. We call this new Theory TC* and this type of computation “Fuzzy time Computation”. We have relatively large number of fundamental unsolved problems in Complexity Theory. In the new Theory some of the major obstacles and unsolved problems are solved. It should be mentioned that in this article, we consider fuzzy number a symmetric one. The point about the symmetry is in the proof of Lemma 3, although we are able to generalize it. More specifically, we define the new classes of complexity Theory, P*, NP*, BPP* in TC* analogues to the definitions P, NP, BPP as their natural substituted definition. We show P*≠ NP*, P*= BPP*. Finally, we have Theorem 4, P≠NP . (shrink)

Here we discuss about the following results: 1.

We have shown the plausibility of considering time as a Fuzzy concept instead of classical time [7], [8]. By considering time as a fuzzy concept, we will have new classes of Complexity. Here, we show that how some famous problems will be solved in this new picture.

With regard to recent historical developments, the Social Model has been of enormous emancipatory significance, chiefly as a counter-agent against rigid definitions of dis-/ability and the traditional role (marked by misfortune) imposed on disabled people. Based on underdetermined notions of “social construction”, this model presently threatens to unduly narrow reflections on the existential conditions of disabled agents, and to obscure crucial questions facing just social orders of the future. These notions imply an overemphasis on linguistic/mental and cultural acts in the (...) shaping of life courses, whereas physical, practical and existential pre-conditions of life come to be disregarded as purportedly freely available, (natural) features. Conversely, this argumentation sketch – a contribution to DisKo18 – works towards a reconceptualisation of disability rooted in external realism, assuming partially autonomous agents. The paper asks: What is the place of disabled people in the world, given that the elementary conditions and problems of life are not primarily of human origin, but arise out of a complex interaction with elements of external reality? What space remains to them in view of extant impairment-related restrictions? Based on a critique of constructionist tenets, possibilities for a just social order are discussed, considering (a) disabilities vs. (b) external, pre-social factors that limit the range of possible social solutions, with special regard to available resources. This approach is exemplified by placing disability in contexts of ecological sustainability. (Paper in German, short version). (shrink)

I prove both the mathematical conjectures P ≠ NP and the Continuum Hypothesis are eternally unprovable using the same fundamental idea. Starting with the Saunders Maclane idea that a proof is eternal or it is not a proof, I use the indeterminacy of human biological capabilities in the eternal future to show that since both conjectures are independent of Axioms and have definitions connected with human biological capabilities, it would be impossible to prove them eternally without the creation and widespread (...) acceptance of new axioms. I also show that the same fundamental concepts cannot be used to demonstrate the eternal unprovability of many other mathematical theorems and open conjectures. Finally I investigate the idea’s implications for the foundations of mathematics including its relation to Godel’s Incompleteness Theorem and Tarsky’s Undefinability Theorem. (shrink)

Throughout this paper, in a nutshell we try to show a way to check Fuzzy time in general and Fuzzy time-Particle interpretation of Quantum Mechanics, experimentally. . -/- .

According to an increasingly popular view in epistemology and philosophy of mind, beliefs are sensitive to contextual factors such as practical factors and salient error possibilities. A prominent version of this view, called credal sensitivism, holds that the context-sensitivity of belief is due to the context-sensitivity of degrees of belief or credence. Credal sensitivism comes in two variants: while credence-one sensitivism (COS) holds that maximal confidence (credence one) is necessary for belief, threshold credal sensitivism (TCS) holds that belief consists in (...) having credence above some threshold, where this threshold doesn’t require maximal confidence. In this paper, I argue that COS has difficulties in accounting for three important features about belief: i) the compatibility between believing p and assigning non-zero credence to certain error possibilities that one takes to entail not-p, ii) the fact that outright beliefs can occur in different strengths, and iii) beliefs held by unconscious subjects. I also argue that TCS can easily avoid these problems. Finally, I consider an alleged advantage of COS over TCS in terms of explaining beliefs about lotteries. I argue that lottery cases are rather more problematic for COS than TCS. In conclusion, TCS is the most plausible version of credal sensitivitism. (shrink)

In our research about Fuzzy Time and modeling time, "Unexpected Hanging Paradox" plays a major role. Here, we compare this paradox to the Zeno Paradox and the relations of them with our standard models of continuum and Fuzzy numbers. To do this, we review the project "Fuzzy Time and Possible Impacts of It on Science" and introduce a new way in order to approach the solutions for these paradoxes. Additionally, we have a more general discussion about paradoxes, as Philosophical back (...) ground of the subject and in this way, we introduce the concepts of General View, the first picture, BBF-General View. (shrink)

. In our research about Fuzzy Time and modeling time, "Unexpected Hanging Paradox" plays a major role. Here, we compare this paradox to the Zeno Paradox and the relations of them with our standard models of continuum and Fuzzy numbers. To do this, we review the project "Fuzzy Time and Possible Impacts of It on Science" and introduce a new way in order to approach the solutions for these paradoxes. Additionally, we have a more general discussion about paradoxes, as Philosophical (...) back ground of the subject and in this way, we introduce the concepts of General View, the first picture, BBF-General View. -/- . (shrink)

Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...) solution for the so-called NP-complete problems will also be a solution for any other such problems. Its artificial-intelligence analogue is the class of AI-complete problems, for which a complete mathematical formalization still does not exist. In this chapter we will focus on analysing computational classes to better understand possible formalizations of AI-complete problems, and to see whether a universal algorithm, such as a Turing test, could exist for all AI-complete problems. In order to better observe how modern computer science tries to deal with computational complexity issues, we present several different deep-learning strategies involving optimization methods to see that the inability to exactly solve a problem from a higher order computational class does not mean there is not a satisfactory solution using state-of-the-art machine-learning techniques. Such methods are compared to philosophical issues and psychological research regarding human abilities of solving analogous NP-complete problems, to fortify the claim that we do not need to have an exact and correct way of solving AI-complete problems to nevertheless possibly achieve the notion of strong AI. (shrink)

The work provides comprehensively definitive, unconditional proofs of Riemann's hypothesis, Goldbach's conjecture, the 'twin primes' conjecture, the Collatz conjecture, the Newcomb-Benford theorem, and the Quine-Putnam Indispensability thesis. The proofs validate holonomic metamathematics, meta-ontology, new number theory, new proof theory, new philosophy of logic, and unconditional disproof of the P/NP problem. The proofs, metatheory, and definitions are also confirmed and verified with graphic proof of intrinsic enabling and sustaining principles of reality.

The work provides comprehensively definitive, unconditional proofs of Riemann's hypothesis, Goldbach's conjecture, the 'twin primes' conjecture, the Collatz conjecture, the Newcomb-Benford theorem, and the Quine-Putnam Indispensability thesis. The proofs validate holonomic metamathematics, meta-ontology, new number theory, new proof theory, new philosophy of logic, and unconditional disproof of the P/NP problem. The proofs, metatheory, and definitions are also confirmed and verified with graphic proof of intrinsic enabling and sustaining principles of reality.

One of the possible hypotheses about time is to consider any instant of time as fuzzy number, so that two instants of time could be overlapped. Historically, some Mathematicians and Philosophers have had similar ideas like Brouwer and Husserl [5]. Throughout this article, the impact of this change on Theory of Computation and Complexity Theory are studied. In order to rebuild Theory of Computation in a more successful and productive approach to solve some major problems in Complexity Theory, the present (...) research is done. This novel theory is called here, the fuzzy time theory of computation, TC^*. (shrink)

A substantial proportion of human embryos spontaneously abort soon after conception, and ethicists have argued this is problematic for the pro-life view that a human embryo has the same moral status as an adult from conception. Firstly, if human embryos are our moral equals, this entails spontaneous abortion is one of humanity’s most important problems, and it is claimed this is absurd, and a reductio of the moral status claim. Secondly, it is claimed that pro-life advocates do not act as (...) if spontaneous abortion is important, implying they are failing to fulfill their moral obligations. We report that the primary cause of spontaneous abortion is chromosomal defects, which are currently unpreventable, and show that as the other major cause of prenatal death is induced abortion, pro-life advocates can legitimately continue efforts to oppose it. We also defend the relevance of the killing and letting die distinction, which provides further justification for pro-life priorities. (shrink)

If two theory formulations are merely different expressions of the same theory, then any problem of choosing between them cannot be due to the underdetermination of theories by data. So one might suspect that we need to be able to tell distinct theories from mere alternate formulations before we can say anything substantive about underdetermination, that we need to solve the problem of identical rivals before addressing the problem of underdetermination. Here I consider two possible solutions: Quine (...) proposes that we call two theories identical if they are equivalent under a reconstrual of predicates, but this would mishandle important cases. Another proposal is to defer to the particular judgements of actual scientists. Consideration of an historical episodethe alleged equivalence of wave and matrix mechanicsshows that this second proposal also fails. Nevertheless, I suggest, the original suspicion is wrong; there are ways to enquire into underdetermination without having solved the problem of identical rivals. (shrink)

The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. The pathological self-reference of the conventional halting problem proof counter-examples is overcome. The halt status of these examples is correctly determined. A simulating halt decider remains in pure simulation mode until after it determines that its input will never reach its final state. This eliminates the conventional feedback loop where the behavior of the halt decider effects the behavior of its input.

Many differences exist between the logical relations “equality” and “equivalence”. In this monograph I point out differences that concern definition, linguistics, computational gates and tables, denotation, application, negation of terms, negation of the relation, relations to other relations, the laws of symmetry, transitivity and reflexivity, the laws of commutation and permutation, the law of tautology, the law of distribution, the law of association, propositional meaning, and “genesis”. I also point out a form of “symmetry breaking”: the negation of some equality (...) may yield some non-equality, while the negation of that non-equality might not yield the same equality. (For full access: use the website link of the title page. -- Copyright License: CC BY-NC-ND. -- DOI: 10.17026/dans-zh3-h2b2 --). (shrink)

This is an explanation of a possible new insight into the halting problem provided in the language of software engineering. Technical computer science terms are explained using software engineering terms. No knowledge of the halting problem is required. -/- It is based on fully operational software executed in the x86utm operating system. The x86utm operating system (based on an excellent open source x86 emulator) was created to study the details of the halting problem proof counter-examples at the (...) much higher level of abstraction of C/x86. (shrink)

By making a slight refinement to the halt status criterion measure that remains consistent with the original a halt decider may be defined that correctly determines the halt status of the conventional halting problem proof counter-examples. This refinement overcomes the pathological self-reference issue that previously prevented halting decidability.

A simulating halt decider correctly predicts what the behavior of its input would be if this simulated input never had its simulation aborted. It does this by correctly recognizing several non-halting behavior patterns in a finite number of steps of correct simulation. -/- When simulating halt decider H correctly predicts that directly executed D(D) would remain stuck in recursive simulation (run forever) unless H aborts its simulation of D this directly applies to the halting theorem.

General Introduction: In [1] a Calculus of Qualia (CQ) was proposed. The key idea is that, for example, blackness is radically different than █. The former term, “blackness” refers to or is about a quale, whereas the latter term, “█” instantiates a quale in the reader’s mind and is non-referential; it does not even refer to itself. The meaning and behavior of these terms is radically different. All of philosophy, from Plato through Descartes through Chalmers, including hieroglyphics and emojis, used (...) referential terms up until CQ. This paper in this series of papers address equations vs. qualations (which contain non-referential terms), proofs, and logic. An example of an equation is x+2=4, which uses exclusively referential terms, even if some of them are numbers. A Qualation is like an equation except it uses actual non-referential terms (qualia), like █ ≠ ▲, and can be clearly non-trivial, like ¬((█ ≠ ▲) ∧ (▲ ≠ ■) → (█ ≠ ■)). (see below). This has implications for assertions, proofs, truth, etc. Incompleteness and truth are addressed in a different paper in this series. (shrink)

If there truly is a proof that shows that no universal halt decider exists on the basis that certain tuples: (H, Wm, W) are undecidable, then this very same proof (implemented as a Turing machine) could be used by H to reject some of its inputs. When-so-ever the hypothetical halt decider cannot derive a formal proof from its input strings and initial state to final states corresponding the mathematical logic functions of Halts(Wm, W) or Loops(Wm, W), halting undecidability has been (...) decided. (shrink)

The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. Whenever the pure simulation of the input to simulating halt decider H(x,y) never stops running unless H aborts its simulation H correctly aborts this simulation and returns 0 for not halting.

The Caesar problem arises for abstractionist views, which seek to secure reference for terms such as ‘the number of Xs’ or #X by stipulating the content of ‘unmixed’ identity contexts like ‘#X = #Y’. Frege objects that this stipulation says nothing about ‘mixed’ contexts such as ‘# X = Julius Caesar’. This article defends a neglected response to the Caesar problem: the content of mixed contexts is just as open to stipulation as that of unmixed contexts.

This is an explanation of a key new insight into the halting problem provided in the language of software engineering. Technical computer science terms are explained using software engineering terms. -/- To fully understand this paper a software engineer must be an expert in the C programming language, the x86 programming language, exactly how C translates into x86 and what an x86 process emulator is. No knowledge of the halting problem is required.

According to the psychological account of personal identity, our identity is based on the continuity of psychological connections, and so we do not begin to exist until these are possible, some months after conception. This entails the psychological account faces a challenge from the non-identity problem—our intuition that someone cannot be harmed by actions that are responsible for their existence, even if these actions seem clearly to cause them harm. It is usually discussed with regard to preconception harms, but (...) in the context of the psychological account, it is also applicable to prenatal harms. Inflicting prenatal injury is widely thought to be morally impermissible, but if the injury is identity-determining on the psychological account, then no-one seems to be harmed—rather, the injury is responsible for bringing them into existence. Here, I argue that identity-determining injuries can routinely occur on the psychological account, and that this undermines the account. I assess Nicola Williams’ proposal to salvage the account based on a trans-world account of personal identity, and show that it is unsuccessful. I then show that Jeff McMahan’s embodied mind account of personal identity is also susceptible. I conclude that identity-determining prenatal injuries pose a significant challenge for the psychological account and its variants, and provide a reason for supporting alternative accounts that fix personal identity at conception. (shrink)

General Introduction: In [1] a Calculus of Qualia (CQ) was proposed. The key idea is that, for example, blackness is radically different than █. The former term, “blackness” refers to or is about a quale, whereas the latter term, “█” instantiates a quale in the reader’s mind and is non-referential; it does not even refer to itself. The meaning and behavior of these terms is radically different. All of philosophy, from Plato through Descartes through Chalmers, including hieroglyphics and emojis, used (...) referential terms up until CQ. This paper in this series of papers addresses the question of why is there something rather than nothing, at length, and gives a radical new answer. It has to do with the fact in CQ that, while blackness is contingently possible, █ is necessarily actual, as it was in this sentence. (shrink)

The notion of a simulating termination analyzer is examined at the concrete level of pairs of C functions. This is similar to AProVE: Non-Termination Witnesses for C Programs. The termination status decision is made on the basis of the dynamic behavior of the input. This paper explores what happens when a simulating termination analyzer is applied to an input that calls itself.

MIT Professor Michael Sipser has agreed that the following verbatim paragraph is correct (he has not agreed to anything else in this paper) -------> -/- If simulating halt decider H correctly simulates its input D until H correctly determines that its simulated D would never stop running unless aborted then H can abort its simulation of D and correctly report that D specifies a non-halting sequence of configurations.

A Simulating Halt Decider (SHD) computes the mapping from its input to its own accept or reject state based on whether or not the input simulated by a UTM would reach its final state in a finite number of simulated steps. -/- A halt decider (because it is a decider) must report on the behavior specified by its finite string input. This is its actual behavior when it is simulated by the UTM contained within its simulating halt decider while this (...) SHD remains in UTM mode. (shrink)

This paper will examine the three distributive problems of inequality, social scarcity, and environmental decay. All three of these problems are the result of economic growth that is not properly structured by institutions. It will be argued that each one of these distributive problems exacerbates the other two. Any solution to one of these problems must address the other two as well. This paper will show that these three distributive problems can be minimized through a combination of tax measures, institutional (...) changes, public employment creation, public service provision, and the nationalization of certain industries. (shrink)

The problem of underdetermination is thought to hold important lessons for philosophy of science. Yet, as Kyle Stanford has recently argued, typical treatments of it offer only restatements of familiar philosophical problems. Following suggestions in Duhem and Sklar, Stanford calls for a New Induction from the history of science. It will provide proof, he thinks, of “the kind of underdetermination that the history of science reveals to be a distinctive and genuine threat to even our best scientific theories” (Stanford (...) 2001, p. S12). This paper examines Stanford’s New Induction and argues that it – like the other forms of underdetermination that he criticizes – merely recapitulates familiar philosophical conundra. (shrink)

A simulating halt decider correctly predicts whether or not its correctly simulated input can possibly reach its own final state and halt. It does this by correctly recognizing several non-halting behavior patterns in a finite number of steps of correct simulation. Inputs that do terminate are simply simulated until they complete.

In a series of articles we try to show the need of a novel Theory for Theory of Computation based on considering time as a Fuzzy concept. Time is a central concept In Physics. First we were forced to consider some changes and modifications in the Theories of Physics. In the second step and throughout this article we show the positive Impact of this modification on Theory of Computation and Complexity Theory to rebuild it in a more successful and fruitful (...) approach. We call this novel Theory TC*. (shrink)

When we understand that every potential halt decider must derive a formal mathematical proof from its inputs to its final states previously undiscovered semantic details emerge. -/- When-so-ever the potential halt decider cannot derive a formal proof from its input strings to its final states of Halts or Loops, undecidability has been decided. -/- The formal proof involves tracing the sequence of state transitions of the input TMD as syntactic logical consequence inference steps in the formal language of Turing Machine (...) Descriptions. (shrink)

Willingness and readiness of people to do their jobs are among the key factors of a successful enterprise. In XXI century intellectual human labour is gaining unprecedented value and is being developed actively. The demand for intellectual labour calls forth an increasing number of jobs and professions that require an extensive preparation, a large number of working places, high level of integration of joint human efforts, growth of social welfare. These trends are becoming ever more pervasive and are spreading widely (...) in service industries, and that explains the rapid development of the latter when compared to the traditional areas of human activity. In its turn, it heightens the need for staff in service companies, supported by significant personnel turnover and a certain shortage of skilled professionals. These circumstances determine the need for developing a new concept of fostering staff motivation at the enterprises in the sphere of services. In order to reach the stated purpose while conducting our research into tourism and hospitality industry, as well as retail chains, we have examined the problems that arise in the process of staff motivation, and studied the foreign practice of motivating staff in hotels. The obtained analysis results enabled us to work out practical recommendations on improvement of the mechanism of tangible and intangible rewards in service companies, which are based on external and internal motivational factors. Additional attention in the article is paid to the statement that financial incentives should be based on key performance indicators (KPI). We give a detailed consideration to the classification of internal motivation incentives of the staff according to the terms of their realization, and give a schematic representation of the performance dynamics of the internal motivation model in service businesses. (shrink)

The problem considered in this chapter emerges from the tension we find when looking at the design and architecture of chatbots on the one hand and their conversational aptitude on the other. In the way that LLM chatbots are designed and built, we have good reason to suppose they don't possess second-order capacities such as intention, belief or knowledge. Yet theories of conversation make great use of second-order capacities of speakers and their audiences to explain how aspects of interaction (...) succeed. As we can all bear witness to now though, at the point of use chatbots appear capable of performing language tasks at a level close to that of humans. This creates a tension when we consider something like, for example, the classic Gricean theory of implicature. On a broad summary of this type of account, to utter p and implicate q requires the reflexive occurrence of an audience supposing a speaker believes that q, and the speaker believing that their audience can determine they believe it when they utter p. So taken at face value, if a chatbot doesn’t have the capacity for belief, then either in their role as speaker or audience, they would not seem capable of either generating or comprehending implicatures. Yet on the surface it does seem that chatbots are capable of dealing with (some) implicatures, and as such it raises questions about how we should then correlate this with what we think occurs in cases of implicature with chatbots. (shrink)