Увійти

Готові списки джерел за темами / Universal Computing Program

Зміст

Статті в журналах
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Universal Computing Program"

Автор: Grafiati

Опубліковано: 3 червня 2025

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Universal Computing Program".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Universal Computing Program"

1

HUTTER, MARCUS. "THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS." International Journal of Foundations of Computer Science 13, no. 03 (2002): 431–43. http://dx.doi.org/10.1142/s0129054102001199.

Повний текст джерела

Анотація:

An algorithm M is described that solves any well-defined problem p as quickly a the fastest algorithm computing a solution to p, save for a factor of 5 and low-order additive terms. M optimally distributes resources between the execution of provably correct p-solving programs and an enumeration of all proofs, including relevant proofs of program correctness and of time bounds on program runtimes. M avoids Blum's speed-up theorem by ignoring programs without correctness proof. M has broader applicability and can be faster than Levin's universal search, the fastest method for inverting functions

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Gorodnyaya, Lidia. "FUNCTIONAL PROGRAMMING FOR PARALLEL COMPUTING." Bulletin of the Novosibirsk Computing Center. Series: Computer Science, no. 45 (2021): 29–48. http://dx.doi.org/10.31144/bncc.cs.2542-1972.2021.n45.p29-48.

Повний текст джерела

Анотація:

The paper is devoted to modern trends in the application of functional programming to the problems of organizing parallel computations. Functional programming is considered as a meta-paradigm for solving the problems of developing multi-threaded programs for multiprocessor complexes and distributed systems, as well as for solving the problems associated with rapid IT development. The semantic and pragmatic principles of functional programming and consequences of these principles are described. The paradigm analysis of programming languages and systems is used, which allows assessing their simi

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Wang DongSheng. "Universal quantum computing models:a resource-theoretic study." Acta Physica Sinica 73, no. 22 (2024): 0. http://dx.doi.org/10.7498/aps.73.20240893.

Повний текст джерела

Анотація:

Quantum computing has been proven to be powerful, however, there are still great challenges for building real quantum computers due to the requirements of both fault-tolerance and universality. People still lack a systematic way to design fast quantum algorithms and identify the key quantum resources. In this work, we develop a resource-theoretic approach to characterize universal quantum computing models and the universal resources for quantum computing.<br>Our theory combines the framework of universal quantum computing model (UQCM) and the quantum resource theory (QRT). The former has

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Emelyanov, S. A. "Actual issues of operation of CNC machines — preparation of control programs." Glavnyj mekhanik (Chief Mechanic), no. 7 (June 15, 2023): 437–47. http://dx.doi.org/10.33920/pro-2-2307-07.

Повний текст джерела

Анотація:

The article analyzes various options for the preparation of control programs for CNC machines: the use of computer-aided design systems, the use of integrated CNC editors, the use of universal computing tools (personal computers, laptops, tablets), interactive writing of the program in manual control mode, the use of templates for specific processing methods, the use of converters that convert control programs developed by for other CNC systems, the use of converters from raster or vector files.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Hartmann, Lars, Neil D. Jones, Jakob Grue Simonsen, and Søren Bjerregaard Vrist. "Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation." Scientific Annals of Computer Science XXI, no. 1 (2011): 73–106. https://doi.org/10.5281/zenodo.12720717.

Повний текст джерела

Анотація:

Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems notable by its absence: Where are the programs? We identify a number of common features in programming that seem conspicuously absent from the literature on biomolecular computing; to partially redress this absence, we introduce a model of computation that is evidently programmable, by programs reminiscent of low-level computer machine code; and at the same time biologically plausible: its functioning is defined by a sin

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Liu, Xie Quan, Xin Hua Ni, Shu Qin Zhang, Lei Zhao, and Guo Hui Zhong. "The Stress-Strain Analysis for the Nonlinear and Strength Difference Structure of Bars Jointed to Rigid-Body of Fixed-Point Motion." Advanced Materials Research 156-157 (October 2010): 383–86. http://dx.doi.org/10.4028/www.scientific.net/amr.156-157.383.

Повний текст джерела

Анотація:

Many material have different stress-strain relation in tension and compression, generally the relation is nonlinear. In this paper, we use two exponential functions to approximately represent the stress-strain relation of nonlinearly elastic material and analyze strength-difference structure of bars jointed to Rigid-body of fixed-point motion. The displacement method is used to derive the universal expression of calculating stress and strain. The nonlinear equations for computing angular displacement of the rigid-body has been given and general computing program has been worked out. They can b

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Jiang, Zhen Zhen. "Cycloid Pinwheel Planet Drive Nonlinear Meshing Stiffness Calculation and Analysis." Applied Mechanics and Materials 543-547 (March 2014): 224–27. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.224.

Повний текст джерела

Анотація:

Mathematical model of pin-cycloid meshing stiffness is set up by profile modification with clearance meshing analytical method. An universal program of pin-cycloid meshing stiffness is compiled, by which meshing stiffness is computed. Computing results show that meshing stiffness is changing with time greatly, which indicate that changing meshing stiffness is a main factor on vibration of whole machine. Better value of modification and curtate ratio coefficient are gotten by analyzing factors on meshing stiffness,such as value of modification ,curtate ratio coefficient and pin-cycloid radius e

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Hamzeh, Ali, and Zakaria Al-Omari. "Improved model for investigating transient stability in multimachine power systems." Indonesian Journal of Electrical Engineering and Computer Science 13, no. 1 (2019): 368–76. https://doi.org/10.11591/ijeecs.v13.i1.pp368-376.

Повний текст джерела

Анотація:

The determinant factor in transient stability study of electric power systems is the behavior of synchronous generators when subjected to sudden and large disturbances. The objective of this paper is to develop a mathematical model, general algorithm, and a computer program to investigate the transient stability of multi-machine power systems. The developed mathematical model is established as a first step. The new developments lie in modeling the fault occurrence and fault clearance as well as the procedure of computing the system matrices during and after the fault through only modification

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Hou, Xiang Lin, De Sheng Huang, and Cong Chen. "Optimization Algorithm of Matrix Riccati Differential Equation and Application." Advanced Engineering Forum 2-3 (December 2011): 801–6. http://dx.doi.org/10.4028/www.scientific.net/aef.2-3.801.

Повний текст джерела

Анотація:

To the matrix Riccati differential equation, based on dynamic design Variables Optimization Method, making unknown element of Riccati matrix as design variables, square sum of defined summation matrix element as objective function, a kind of new optimization Method about element of Riccati matrix orders is built. Universal program is formed. Practical examples are computed. Effectiveness is shown through result. The method is a new thinking for computing high order matrix Riccati Differential equation and obtaining control parameters.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Alfonseca, Manuel, Manuel Cebrian, Antonio Fernandez Anta, Lorenzo Coviello, Andrés Abeliuk, and Iyad Rahwan. "Superintelligence Cannot be Contained: Lessons from Computability Theory." Journal of Artificial Intelligence Research 70 (January 5, 2021): 65–76. http://dx.doi.org/10.1613/jair.1.12202.

Повний текст джерела

Анотація:

Superintelligence is a hypothetical agent that possesses intelligence far surpassing that of the brightest and most gifted human minds. In light of recent advances in machine intelligence, a number of scientists, philosophers and technologists have revived the discussion about the potentially catastrophic risks entailed by such an entity. In this article, we trace the origins and development of the neo-fear of superintelligence, and some of the major proposals for its containment. We argue that total containment is, in principle, impossible, due to fundamental limits inherent to computing itse

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Universal Computing Program"

1

Roman, Brandl, ed. The DB2 Universal DRDA certification guide. Prentice Hall PTR, 1999.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Bill, Wong, ed. Sams teach yourself DB2 Universal Database in 21 days. 2nd ed. Sams, 2004.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Cook, Jonathan, Roman Brandl, Diand D. Bullock, and Robert Hobus. DB2 Universal DRDA Certification Guide, The. Prentice Hall, 1998.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Sams teach yourself DB2 Universal Database in 21 days. Sams Pub., 1998.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Wong, Bill, and Susan Visser. Sams Teach Yourself DB2 Universal Database in 21 Days, Second Edition. 2nd ed. Sams, 2003.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Anderson, James A. Software. Oxford University Press, 2018. http://dx.doi.org/10.1093/acprof:oso/9780199357789.003.0004.

Повний текст джерела

Анотація:

Digital computers are “protean” in that they can become almost anything through software. Their basic design elements came from a 19th-century British tradition in logic, exemplified by Boole and Babbage. It seemed natural to have logic realized in hardware. This tradition culminated in the work of Alan Turing who proposed a universal computing machine, now called a Turing machine, based on logic. Although hardware that computes logic functions lies at the core of digital hardware, low-level practical machine operations are grouped together in “words.” Programs are based on hardware operations

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Copeland, B. J., ed. The Essential Turing. Oxford University Press, 2004. http://dx.doi.org/10.1093/oso/9780198250791.001.0001.

Повний текст джерела

Анотація:

Alan Turing was one of the most influential thinkers of the 20th century. In 1935, aged 22, he developed the mathematical theory upon which all subsequent stored-program digital computers are modeled. At the outbreak of hostilities with Germany in September 1939, he joined the Government Codebreaking team at Bletchley Park, Buckinghamshire and played a crucial role in deciphering Engima, the code used by the German armed forces to protect their radio communications. Turing's work on the version of Enigma used by the German navy was vital to the battle for supremacy in the North Atlantic. He al

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Universal Computing Program"

1

Paul, Swarna Kamal, Prince Gupta, and Parama Bhaumik. "Learning to Solve Single Variable Linear Equations by Universal Search with Probabilistic Program Graphs." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16681-6_31.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Crain, Tyler, Damien Imbs, and Michel Raynal. "Towards a Universal Construction for Transaction-Based Multiprocess Programs." In Distributed Computing and Networking. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25959-3_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Aliferis, Constantin, and Gyorgy Simon. "Foundations and Properties of AI/ML Systems." In Health Informatics. Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-39355-6_2.

Повний текст джерела

Анотація:

AbstractThe chapter provides a broad introduction to the foundations of health AI and ML systems and is organized as follows: (1) Theoretical properties and formal vs. heuristic systems: computability, incompleteness theorem, space and time complexity, exact vs. asymptotic complexity, complexity classes and how to establish complexity of problems even in the absence of known algorithms that solve them, problem complexity vs. algorithm and program complexity, and various other properties. Moreover, we discuss the practical implications of complexity for system tractability, the folly of expecti

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Chen, Kean, Yuhao Liu, Wang Fang, et al. "Verifying Fault-Tolerance of Quantum Error Correction Codes." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-98685-7_1.

Повний текст джерела

Анотація:

Abstract Quantum computers have advanced rapidly in qubit count and gate fidelity. However, large-scale fault-tolerant quantum computing still relies on quantum error correction code (QECC) to suppress noise. Manually or experimentally verifying the fault-tolerance property of complex QECC implementation is impractical due to the vast error combinations. This paper formalizes the fault-tolerance of QECC implementations within the language of quantum programs. By incorporating the techniques of quantum symbolic execution, we provide an automatic verification tool for quantum fault-tolerance. We

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Davies, D. W. "Repairs to Turing’s Universal Computing Machine." In Machine Intelligence 15. Oxford University PressOxford, 2000. http://dx.doi.org/10.1093/oso/9780198538677.003.0023.

Повний текст джерела

Анотація:

Abstract On Computable Numbers, with an Application to the Entscheidungsproblem, published by the London Mathematical Society in 1937, must be one of the most important and influential papers in the history of mathematical logic. It resolved the decision problem posed by Hilbert, gave an intuitive yet precise definition of computability and anticipated the stored-program computer which is central to today’s technology. Its author, the young Alan Turing, was to become one of the World War II codebreakers, using electronic calculators to speed up the running of his algorithms and then one of the

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Zaitsev, Dmitry A. "Sleptsov Net Computing." In Advances in Computer and Electrical Engineering. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7598-6.ch122.

Повний текст джерела

Анотація:

Motivation for new models of hyper-computations was presented. Sleptsov net was introduced compared to Petri and Salwicki nets. A concept of universal Sleptsov net, as a prototype of a processor in Sleptsov net computing, was discussed. Small universal Sleptsov net that runs in polynomial time was constructed; it consists of 15 places and 29 transitions. Principles of programming in Sleptsov nets, as composition of reverse control flow and data, have been developed. Standard control flow patterns include sequence, branching, loop, and parallel execution. Basic modules, which implement efficien

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Zaitsev, Dmitry A. "Sleptsov Net Computing." In Encyclopedia of Information Science and Technology, Fourth Edition. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2255-3.ch672.

Повний текст джерела

Анотація:

Motivation for new models of hyper-computations was presented. Sleptsov net was introduced compared to Petri and Salwicki nets. A concept of universal Sleptsov net, as a prototype of a processor in Sleptsov net computing, was discussed. Small universal Sleptsov net that runs in polynomial time was constructed; it consists of 15 places and 29 transitions. Principles of programming in Sleptsov nets, as composition of reverse control flow and data, have been developed. Standard control flow patterns include sequence, branching, loop, and parallel execution. Basic modules, which implement efficien

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Brady, Allen H., and the Meaning of Life. "The Busy Beaver Game and the Meaning of Life." In The Universal Turing Machine: A Half-Century Survey. Oxford University PressOxford, 1990. http://dx.doi.org/10.1093/oso/9780198537748.003.0009.

Повний текст джерела

Анотація:

Abstract The representation of the Universal Computing Machine in the guise of the stored-program digital computer is now well known among serious students of computer science. On the periphery, a modem generation of technologists seems unable to conceive of a time when “computer” meant “a person who computes” and the concept of “programming” was not ubiquitous. For practical reasons, a modem computer is much more complex than is minimally necessary to achieve universality. The original formulation of a Universal Computing Machine (Turing 1936-7) involved a table based upon 15 symbols and 28 s

Стилі APA, Harvard, Vancouver, ISO та ін.

9

DRAUX, Andrë, and Patrick VAN INGELANDT. "AN UNIVERSAL CONVERSATIONAL PROGRAM FOR COMPUTING SEQUENCES OF PADE APPROXIMANTS IN THE NON NORMAL CASE." In Numerical Mathematics and Applications. Elsevier, 1986. http://dx.doi.org/10.1016/b978-0-444-70067-4.50016-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Copeland, Jack. "Baby." In The Turing Guide. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198747826.003.0029.

Повний текст джерела

Анотація:

The modern computer age began on 21 June 1948, when the first electronic universal stored-program computer successfully ran its first program. Built in Manchester, this ancestral computer was the world’s first universal Turing machine in hardware. Fittingly, it was called simply ‘Baby’. The story of Turing’s involvement with Baby and with its successors at Manchester is a tangled one. The world’s first electronic stored-program digital computer ran its first program in the summer of 1948 (Fig. 20.1). ‘A small electronic digital computing machine has been operating successfully for some weeks i

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Universal Computing Program"

1

Paul, Swarna Kamal, and Parama Bhaumik. "A fast universal search by equivalent program pruning." In 2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI). IEEE, 2016. http://dx.doi.org/10.1109/icacci.2016.7732087.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Tan, Grace, and Anne Venables. "Survival Mode: The Stresses and Strains of Computing Curricula Review." In InSITE 2008: Informing Science + IT Education Conference. Informing Science Institute, 2008. http://dx.doi.org/10.28945/3195.

Повний текст джерела

Анотація:

In an ideal world, review and changes to computing curricula should be driven solely by academic concerns for the needs of students. The process should be informed by industry accreditation processes and international best practice (Hurst et al., 2001). However, Australian computing curricular review is often driven by the need for financial viability of programs with declining student numbers as much as concerns for academic merit. Worldwide there remains a strong job market and high demand for computing professionals (Liu, 2007; Melymuka, 2006), which predicates an impending IT workforce sho

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Gorodnyaya, Lidia Vasiljevna. "The Role of Functional Programming in the Organization of Parallel Computing." In 23rd Scientific Conference “Scientific Services & Internet – 2021”. Keldysh Institute of Applied Mathematics, 2021. http://dx.doi.org/10.20948/abrau-2021-5-ceur.

Повний текст джерела

Анотація:

The article is devoted to the results of the analysis of modern trends in the field of functional programming, considered as a methodology for solving problems of organizing parallel computing. The paradigm analysis of languages and functional programming systems is involved. Taking into account paradigmatic features is useful in predicting the course of application processes of programs, as well as in planning their study and development. Functional programming helps to improve the performance of programs by preparing their prototypes in advance. The description of the semantic and pragmatic

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Samuel, Robello, Vikrant Lakhanpal, and Kiran Kumar. "Blockchain Supercharges Digital Well Program towards Cyber-Physical Drilling System." In SPE/IADC Middle East Drilling Technology Conference and Exhibition. SPE, 2023. http://dx.doi.org/10.2118/214536-ms.

Повний текст джерела

Анотація:

Abstract The oil and gas industry is transforming itself into a data-intensive industry with the addition of artificial engineering intelligence, cognitive computing, machine learning, internet of things and robotics. With the growth and expansion, various exponential technologies can carry the energy industry's transformation forward in the new era of cyber-automation and more so on the cyber-physical -automation. Blockchain technology can drastically streamline the current complex matrix of activities from seismic to production and abonnement. The existing integration and management of vario

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Lobo, Theresa. "Innovative intelligent technology and information systems for visually impaired." In 13th International Conference on Applied Human Factors and Ergonomics (AHFE 2022). AHFE International, 2022. http://dx.doi.org/10.54941/ahfe1001891.

Повний текст джерела

Анотація:

The paper presents a develop innovative intelligent technology and information systems for visually impaired students. To solve this problem a comprehensive approach has been proposed, which consists in the aggregate of the application of artificial intelligence methods and statistical analysis. Creating an accessible learning environment, identifying the intellectual, physiological, psychophysiological characteristics of perception and information awareness by this category of students is based on a cognitive approach. Based on IT network program developed specifically for visually impaired s

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Arnaiz Eguren, Ignacio. "Planeamiento digital, la primera pieza de una ciudad virtual de mantenimiento distribuido." In International Conference Virtual City and Territory. Centre de Política de Sòl i Valoracions, 2009. http://dx.doi.org/10.5821/ctv.7581.

Повний текст джерела

Анотація:

En los últimos años se han planteado en España diversos sistemas para traducir el Planeamiento urbano a un sistema digital, (Extremadura, Castilla y León, Canarias…). En el presente trabajo se exponen las características principales que definen la propuesta de planeamiento digital establecida en el programa “Impulso del Urbanismo en Red” del Ministerio de Industria, cuya arquitectura ha sido definida por el autor de esta ponencia y que se resumen en: * La definición de una estructura de información encapsulable en un fichero GML capaz de contener cualquier p

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Universal Computing Program"

1

Langlais, Pierre-Carl. Open Scientific Data. Comité pour la science ouverte, 2023. https://doi.org/10.52949/69.

Повний текст джерела

Анотація:

Not opening scientific data is costly. It has been estimated that a significant share of scientific knowledge disappears every year. In a 2014 study less than half of biological datasets from the 1990s have been recovered and when possible the recovery has necessitated significant time and efforts. In comparison, 98% of datasets published on PLOS with unique identifiers (data DOIs) are still available for future research. Open scientific data are fundamental resources for a large variety of scientific activities: meta-analysis, replication of research results or accessibility to primary source

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!